Optimal set partitioning, matchings and lagrangian duality
From MaRDI portal
Publication:3960468
Cites work
- scientific article; zbMATH DE number 3573593 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 3438384 (Why is no real title available?)
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- An Algorithm for Large Set Partitioning Problems
- Maximum matching and a polyhedron with 0,1-vertices
- Paths, Trees, and Flowers
- Sensitivity analysis of optimal matchings
- The traveling-salesman problem and minimum spanning trees: Part II
- Validation of subgradient optimization
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)
