Reformulations in Mathematical Programming: Definitions and Systematics
From MaRDI portal
Publication:3621976
DOI10.1051/ro/2009005zbMath1158.90390MaRDI QIDQ3621976
Publication date: 23 April 2009
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/105423
90C11: Mixed integer programming
90C26: Nonconvex programming, global optimization
90C30: Nonlinear programming
90C27: Combinatorial optimization
90C99: Mathematical programming
Related Items
Divisive heuristic for modularity density maximization, Column generation bounds for numerical microaggregation, Stabilizer-based symmetry breaking constraints for mathematical programs, New error measures and methods for realizing protein graphs from distance data, An improved column generation algorithm for minimum sum-of-squares clustering, Reformulations in mathematical programming: automatic symmetry detection and exploitation, Editorial: Reformulation techniques in mathematical programming, Distance geometry and data science, Production planning and scheduling in mining scenarios under IPCC mining systems, Optimization and sustainable development, Bound reduction using pairs of linear inequalities, A multiplicative weights update algorithm for MINLP, A mathematical programming formulation for the Hartree-Fock problem on open-shell systems, On the Weber facility location problem with limited distances and side constraints, A locally optimal hierarchical divisive heuristic for bipartite modularity maximization, Unnamed Item, Mixed Integer Linear Programming Formulation Techniques, Static Analysis by Abstract Interpretation: A Mathematical Programming Approach, Optimal design of electrical machines: mathematical programming formulations, Symmetry in Mathematical Programming, Orbital Independence in Symmetric Mathematical Programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convexification of nonlinear programming problems: An applications-oriented survey
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- ``Miniaturized linearizations for quadratic 0/1 problems
- Global optimization. From theory to implementation.
- Routing of uncertain traffic demands
- Tractable approximate robust geometric programming
- MIP reformulations of the probabilistic set covering problem
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Existence and sum decomposition of vertex polyhedral convex envelopes
- On the choice of explicit stabilizing terms in column generation
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- A linearization framework for unconstrained quadratic (0-1) problems
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- Reformulation in mathematical programming: An application to quantum chemistry
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- An interior point potential reduction algorithm for the linear complementarity problem
- A new reformulation-linearization technique for bilinear programming problems
- A multivariate global optimization using linear bounding functions
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Links between linear bilevel and mixed 0-1 programming problems
- Global optimization of nonconvex polynomial programming problems having rational exponents
- On a new class of bilevel programming problems and its use for reformulating mixed integer problems
- Extremal problems with d.c.-contraints.
- Convex extensions and envelopes of lower semi-continuous functions
- Pruning by isomorphism in branch-and-cut
- Recent advances in the solution of quadratic assignment problems
- Convex envelopes of monomials of odd degree
- Exploiting orbits in symmetric ILP
- Reformulation and convex relaxation techniques for global optimization
- Reformulation descent applied to circle packing problems
- The linear complementarity problem as a separable bilinear program
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- Computing global minima to polynomial optimization problems using Gröbner bases
- On bilevel programming. I: General nonlinear cases
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Compact linearization for binary quadratic problems
- Linearity embedded in nonconvex programs
- Improving Discrete Model Representations via Symmetry Considerations
- Pooling Problem: Alternate Formulations and Solution Methods
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Semidefinite optimization
- Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz
- The Price of Robustness
- Jointly Constrained Biconvex Programming
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Methods of Nonlinear 0-1 Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Linear complementarity problems solvable by A single linear program
- Reduction constraints for the global optimization of NLPs
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases
- Automatic Generation of Symmetry-Breaking Constraints
- Global optimization of nonconvex factorable programming problems
