Integer Programming and Combinatorial Optimization

DOI10.1007/b97946zbMath1092.90530OpenAlexW2484779063MaRDI QIDQ5712451

Ismael Regis jun. de Farias

Publication date: 23 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b97946

zbMATH Keywords

disjunctive programmingbranch-and-cutmixed-integer programmingpolyhedral combinatoricssemi-continuous variables

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (7)

The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints ⋮ Relaxations of Discrete Sets with Semicontinuous Variables ⋮ Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints ⋮ A polyhedral study of the semi-continuous knapsack problem ⋮ A special ordered set approach for optimizing a discontinuous separable piecewise linear function ⋮ Semi-continuous network flow problems ⋮ Challenges in Enterprise Wide Optimization for the Process Industries

This page was built for publication: Integer Programming and Combinatorial Optimization