Optimal set partitioning, matchings and lagrangian duality

DOI10.1002/NAV.3800260401zbMATH Open0496.90057OpenAlexW1959130699MaRDI QIDQ3960468FDOQ3960468

Authors: G. L. Nemhauser, Glenn M. Weber 

Publication date: 1979

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/13088

zbMATH Keywords

sensitivity analysisLagrangian relaxationcyclic coordinate methodmatching problemLagrangian dualset partitioning problemsimple side constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Boolean programming (90C09)

Cites Work

• Paths, Trees, and Flowers
• Title not available (Why is that?)
• Validation of subgradient optimization
• Maximum matching and a polyhedron with 0,1-vertices
• The traveling-salesman problem and minimum spanning trees: Part II
• Title not available (Why is that?)
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• Title not available (Why is that?)
• An Algorithm for Large Set Partitioning Problems
• Sensitivity analysis of optimal matchings

Cited In (13)

• Graph theoretic relaxations of set covering and set partitioning problems
• Efficient automated pallet loading
• Use of hidden network structure in the set partitioning problem
• Matching problems with generalized upper bound side constraints
• A network relaxation based enumeration algorithm for set partitioning
• Using dual network bounds in algorithms for solving generalized set packing/partitioning problems
• Dynamic matchings and quasidynamic fractional matchings. I
• An analysis of alternative strategies for implementing matching algorithms
• Sensitivity analysis of optimal matchings
• Experiments with parallel branch-and-bound algorithms for the set covering problem
• The matching relaxation for a class of generalized set partitioning problems
• A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints
• Tighter representations for set partitioning problems

This page was built for publication: Optimal set partitioning, matchings and lagrangian duality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3960468)