Strong and compact relaxations in the original space using a compact extended formulation

DOI10.1007/S13675-012-0004-6MaRDI QIDQ458127zbMATH OpenOpenAlexFDO

Authors Mathieu Van Vyve, Laurence A. Wolsey

Publication date 30 September 2014

Published in EURO Journal on Computational Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1007/s13675-012-0004-6

zbMATH Keywords

Benders' algorithmdecompositionstrong dual bound

Mathematics Subject Classification ID

Integer programming (90C10) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Reformulation and decomposition of integer programs
• Deriving compact extended formulations via LP-based separation techniques
• Deriving compact extended formulations via LP-based separation techniques
• scientific article; zbMATH DE number 6000617
• Approximate extended formulations

Cites work

• Extended formulations in combinatorial optimization
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• Partitioning procedures for solving mixed-variables programming problems
• Reformulation and decomposition of integer programs
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems

Cited in

(2)

• Relaxing high-dimensional constraints in the direct solution space method for early phase development
• Beating the SDP bound for the floor layout problem: a simple combinatorial idea

Describes a project that uses

Uses Software

• PORTA

This page was built for publication: Strong and compact relaxations in the original space using a compact extended formulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458127)