Pages that link to "Item:Q1922639"
From MaRDI portal
The following pages link to A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems (Q1922639):
Displaying 16 items.
- A dual ascent procedure for the set partitioning problem (Q955334) (← links)
- Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
- Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms (Q1096544) (← links)
- On some difficult linear programs coming from set partitioning (Q1348247) (← links)
- A concurrent processing framework for the set partitioning problem (Q1603333) (← links)
- Improved integral simplex using decomposition for the set partitioning problem (Q1616829) (← links)
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015) (← links)
- Modelling transfer line design problem via a set partitioning problem (Q1758032) (← links)
- Conflict graphs in solving integer programming problems (Q1969889) (← links)
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
- The multiphase course timetabling problem (Q2116932) (← links)
- A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
- A parallel, linear programming-based heuristic for large-scale set partitioning problems (Q2884506) (← links)
- VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH (Q3393492) (← links)
- A Multiplier Adjustment Approach for the Set Partitioning Problem (Q3990562) (← links)
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594) (← links)
