Comments on ``enhancements on the hyperplanes arrangements in mixed-integer programming techniques

DOI10.1007/s10957-013-0482-6zbMath1304.90146OpenAlexW120089383MaRDI QIDQ463016

Roberto Kawakami Harrop Galvão, Rubens Junqueira Magalhães Afonso

Publication date: 23 October 2014

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-013-0482-6

zbMATH Keywords

mixed integer programminghyperplane arrangementsnot convex constraintsunallocated tuples

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (2)

Robust intersample crossing of target sets with mixed‐integer linear programming ⋮ Reduction in the number of binary variables for inter-sample avoidance in trajectory optimizers using mixed-integer linear programming

Cites Work

• Enhancements on the hyperplanes arrangements in mixed-integer programming techniques
• Mixed integer models for the stationary case of gas network optimization
• On the Significance of Solving Linear Programming Problems with Some Integer Variables
• Robust variable horizon model predictive control for vehicle maneuvering

This page was built for publication: Comments on ``enhancements on the hyperplanes arrangements in mixed-integer programming techniques