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

DOI10.1007/S13675-012-0004-6zbMATH Open1304.90145OpenAlexW2079205659MaRDI QIDQ458127FDOQ458127

Authors: Mathieu Van Vyve, Laurence A. Wolsey 

Publication date: 30 September 2014

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

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

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

zbMATH Keywords

decompositionBenders' algorithmstrong dual bound

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Partitioning procedures for solving mixed-variables programming problems
• Extended formulations in combinatorial optimization
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
• Reformulation and decomposition of integer programs

Cited In (2)

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

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)