Cuts over extended formulations by flow discretization

MaRDI QIDQ3109941zbMATH OpenFDO

Authors Eduardo Uchoa

Publication date 26 January 2012

zbMATH Keywords

network flow problemhigh-quality bounds

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Extended formulations in combinatorial optimization
• Extended formulations in combinatorial optimization
• Approximate extended formulations
• Uncapacitated flow-based extended formulations
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems

Cited in

(5)

• Layered graph approaches for combinatorial optimization problems
• Load-dependent and precedence-based models for pickup and delivery problems
• Arc flow formulations based on dynamic programming: theoretical foundations and applications
• Exact solution of network flow models with strong relaxations
• Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem

Describes a project that uses

Uses Software

• CVRPSP

This page was built for publication: Cuts over extended formulations by flow discretization

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