Editorial: Reformulation techniques in mathematical programming
From MaRDI portal
Publication:1025983
DOI10.1016/j.dam.2008.10.016zbMath1170.90304OpenAlexW2242422634MaRDI QIDQ1025983
Leo Liberti, Nelson F. Maculan
Publication date: 23 June 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.10.016
Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Mathematical programming (90Cxx)
Related Items (4)
Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT ⋮ The supporting hyperplane optimization toolkit for convex MINLP ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ Automatic Generation of Symmetry-Breaking Constraints
Cites Work
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Links between linear bilevel and mixed 0-1 programming problems
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Reformulations in Mathematical Programming: Definitions and Systematics
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
This page was built for publication: Editorial: Reformulation techniques in mathematical programming
