Pages that link to "Item:Q4088572"

The following pages link to On the Set-Covering Problem: II. An Algorithm for Set Partitioning (Q4088572):

Displayed 27 items.

• Non-standard approaches to integer programming (Q697562) ‎ (← links)
• Influence of the normalization constraint on the integral simplex using decomposition (Q729804) ‎ (← links)
• Column generation in the integral simplex method (Q948677) ‎ (← links)
• A network relaxation based enumeration algorithm for set partitioning (Q1123128) ‎ (← links)
• Logic applied to integer programming and integer programming applied to logic (Q1130078) ‎ (← links)
• Implicit enumeration algorithms for the set-partitioning problem (Q1143941) ‎ (← links)
• Set partitioning mit linearen Randbedingungen (Q1144493) ‎ (← links)
• A characterization of the uncapacitated network design polytope (Q1200785) ‎ (← links)
• Methods for task allocation via agent coalition formation (Q1274277) ‎ (← links)
• Clustering heuristics for set covering (Q1309879) ‎ (← links)
• The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems (Q1333026) ‎ (← links)
• Negotiation and cooperation in multi-agent environments (Q1391348) ‎ (← links)
• Improved integral simplex using decomposition for the set partitioning problem (Q1616829) ‎ (← links)
• Integral simplex using decomposition with primal cutting planes (Q1683694) ‎ (← links)
• Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling (Q1694842) ‎ (← links)
• The simple plant location problem: Survey and synthesis (Q1837098) ‎ (← links)
• Adjacency on combinatorial polyhedra (Q1842660) ‎ (← links)
• Tighter representations for set partitioning problems (Q1917353) ‎ (← links)
• Distributed integral column generation for set partitioning problems (Q2139355) ‎ (← links)
• Integral simplex using double decomposition for set partitioning problems (Q2273675) ‎ (← links)
• Improving set partitioning problem solutions by zooming around an improving direction (Q2288990) ‎ (← links)
• The three-dimensional assignment and partition problems. New lower bounds (Q2457504) ‎ (← links)
• Integral Simplex Using Decomposition for the Set Partitioning Problem (Q2875612) ‎ (← links)
• Adjacency on polymatroids (Q3335528) ‎ (← links)
• Lineare Charakterisierungen von Travelling Salesman Problemen (Q4119037) ‎ (← links)
• Integral Column Generation for Set Partitioning Problems with Side Constraints (Q5106424) ‎ (← links)
• Modeling and algorithmic development of a staff scheduling problem (Q5925863) ‎ (← links)