Pages that link to "Item:Q1291724"
From MaRDI portal
The following pages link to Efficient cuts in Lagrangean `relax-and-cut' schemes (Q1291724):
Displayed 12 items.
- An homage to Joseph-Louis Lagrange and Pierre Huard (Q537596) (← links)
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm (Q811891) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (Q1046712) (← links)
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships (Q1339126) (← links)
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem (Q1584797) (← links)
- Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes (Q1972019) (← links)
- Decomposition and dynamic cut generation in integer linear programming (Q2490337) (← links)
- New approaches for optimizing over the semimetric polytope (Q2576727) (← links)
- A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem (Q2883626) (← links)
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)