Pages that link to "Item:Q5576127"

The following pages link to The Set-Partitioning Problem: Set Covering with Equality Constraints (Q5576127):

Displaying 37 items.

• Irregular polyomino tiling via integer programming with application in phased array antenna design (Q288219) (← links)
• Influence of the normalization constraint on the integral simplex using decomposition (Q729804) (← links)
• A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases (Q819123) (← links)
• A hybrid exact algorithm for complete set partitioning (Q901033) (← links)
• Rounding to an integral program (Q943791) (← links)
• Balancing modular transfer lines with serial-parallel activation of spindle heads at stations (Q1003756) (← links)
• Branch and bound algorithm for a transfer line design problem: stations with sequentially activated multi-spindle heads (Q1042027) (← links)
• An efficient algorithm for the complete set partitioning problem (Q1056674) (← links)
• Production planning and scheduling for an integrated container company (Q1058968) (← links)
• A dynamic programming approach to the complete set partitioning problem (Q1091142) (← links)
• A network relaxation based enumeration algorithm for set partitioning (Q1123128) (← links)
• A combined hierarchical and steepest-descent clustering algorithm (Q1141997) (← links)
• Implicit enumeration algorithms for the set-partitioning problem (Q1143941) (← links)
• Set partitioning mit linearen Randbedingungen (Q1144493) (← links)
• Locational analysis (Q1173002) (← links)
• Application of optimization methods to the hematological support of patients with disseminated malignancies (Q1220440) (← links)
• Methods for task allocation via agent coalition formation (Q1274277) (← links)
• A shrunken cyclic inspection schedule for deteriorating production stages (Q1278523) (← links)
• Simple Lagrangian heuristic for the set covering problem (Q1278602) (← links)
• Algorithms for large scale set covering problems (Q1309874) (← links)
• Experiments with parallel branch-and-bound algorithms for the set covering problem (Q1316095) (← links)
• A set partitioning heuristic for the generalized assignment problem (Q1319576) (← links)
• The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems (Q1333026) (← links)
• A surrogate heuristic for set covering problems (Q1342046) (← links)
• Negotiation and cooperation in multi-agent environments (Q1391348) (← links)
• A concurrent processing framework for the set partitioning problem (Q1603333) (← links)
• Integral simplex using decomposition with primal cutting planes (Q1683694) (← links)
• Efficient automated pallet loading (Q1825763) (← links)
• A framework for demand point and solution space aggregation analysis for location models (Q1887955) (← links)
• Tighter representations for set partitioning problems (Q1917353) (← links)
• A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm (Q1919838) (← links)
• A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems (Q1922639) (← links)
• Simultaneous node and link districting in transportation networks: model, algorithms and railway application (Q2030544) (← links)
• Statistical search methods for lotsizing problems (Q2367017) (← links)
• Dual Inequalities for Stabilized Column Generation Revisited (Q2806874) (← links)
• Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning» (Q3035139) (← links)
• The set partitioning problem in a quantum context (Q6181360) (← links)