Pages that link to "Item:Q3960468"
From MaRDI portal
The following pages link to Optimal set partitioning, matchings and lagrangian duality (Q3960468):
Displayed 13 items.
- A network relaxation based enumeration algorithm for set partitioning (Q1123128) (← links)
- A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints (Q1198141) (← links)
- Experiments with parallel branch-and-bound algorithms for the set covering problem (Q1316095) (← links)
- Graph theoretic relaxations of set covering and set partitioning problems (Q1390264) (← links)
- The matching relaxation for a class of generalized set partitioning problems (Q1634772) (← links)
- Using dual network bounds in algorithms for solving generalized set packing/partitioning problems (Q1814995) (← links)
- Efficient automated pallet loading (Q1825763) (← links)
- Tighter representations for set partitioning problems (Q1917353) (← links)
- Dynamic matchings and quasidynamic fractional matchings. I (Q3040950) (← links)
- Matching problems with generalized upper bound side constraints (Q3204346) (← links)
- An analysis of alternative strategies for implementing matching algorithms (Q3668867) (← links)
- Sensitivity analysis of optimal matchings (Q3922722) (← links)
- Use of hidden network structure in the set partitioning problem (Q5101414) (← links)