Pages that link to "Item:Q1291724"

The following pages link to Efficient cuts in Lagrangean `relax-and-cut' schemes (Q1291724):

Displaying 21 items.

• Strengthening lattice-free cuts using non-negativity (Q429683) (← links)
• 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)
• Non delayed relax-and-cut algorithms (Q817212) (← 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)
• A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
• On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
• Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
• Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs (Q1935886) (← links)
• Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes (Q1972019) (← links)
• The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope (Q2056893) (← 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)
• On distance scales, embeddings, and efficient relaxations of the cut cone (Q2921657) (← links)
• Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids (Q3066140) (← links)
• Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
• (Q5294045) (← links)