Amanote Research

Amanote Research

    RegisterSign In

Optimal Set Partitioning, Matchings and Lagrangian Duality

Naval Research Logistics Quarterly
doi 10.1002/nav.3800260401
Full Text
Open PDF
Abstract

Available in full text

Date

December 1, 1979

Authors
George L. NemhauserGlenn M. Weber
Publisher

Wiley


Related search

A Major Index for Matchings and Set Partitions

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2008English

Duality Theorems for Convex and Quasiconvex Set Functions

SN Operations Research Forum
2020English

Single Agents and the Set of Many-To-One Stable Matchings

Journal of Economic Theory
EconomicsEconometrics
2000English

Lagrangian Duality in Online Scheduling With Resource Augmentation and Speed Scaling

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Optimal Partitioning of Sequences

Journal of Algorithms
1995English

Natural Duality via a Finite Set of Relations

Bulletin of the Australian Mathematical Society
Mathematics
1995English

A Fast and Accurate Semi-Lagrangian Particle Level Set Method

Computers and Structures
Materials ScienceMechanical EngineeringCivilStructural EngineeringSimulationComputer Science ApplicationsModeling
2005English

A Fast and Accurate Semi-Lagrangian Particle Level Set Method

2004English

Optimal Partitioning of a Measurable Space

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1988English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy