Reformulations in Mathematical Programming: Definitions and Systematics
From MaRDI portal
Publication:3621976
Recommendations
- Formulations and Reformulations in Integer Programming
- Reformulation and decomposition of integer programs
- Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
- The reformulation-optimization software engine
- Linear, Integer, Separable and Fuzzy Programming Problems: A Unified Approach towards Reformulation
Cites work
- ``Miniaturized linearizations for quadratic 0/1 problems
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- A linearization framework for unconstrained quadratic (0-1) problems
- A multivariate global optimization using linear bounding functions
- A new reformulation-linearization technique for bilinear programming problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- An interior point potential reduction algorithm for the linear complementarity problem
- Automatic Generation of Symmetry-Breaking Constraints
- Compact linearization for binary quadratic problems
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computing global minima to polynomial optimization problems using Gröbner bases
- Convex envelopes of monomials of odd degree
- Convex extensions and envelopes of lower semi-continuous functions
- Disciplined convex programming
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Exploiting orbits in symmetric ILP
- Expressing combinatorial problems by systems of polynomial equations and Hilbert's Nullstellensatz
- Extremal problems with d.c.-contraints.
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization of nonconvex factorable programming problems
- Global optimization of nonconvex polynomial programming problems having rational exponents
- Global optimization. From theory to implementation.
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 2102019 (Why is no real title available?)
- scientific article; zbMATH DE number 757676 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- Improving Discrete Model Representations via Symmetry Considerations
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Jointly Constrained Biconvex Programming
- Linear complementarity problems solvable by A single linear program
- Linearity embedded in nonconvex programs
- Links between linear bilevel and mixed 0-1 programming problems
- Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases
- Methods of Nonlinear 0-1 Programming
- MIP reformulations of the probabilistic set covering problem
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- On a new class of bilevel programming problems and its use for reformulating mixed integer problems
- On bilevel programming. I: General nonlinear cases
- On the choice of explicit stabilizing terms in column generation
- On the convexification of nonlinear programming problems: An applications-oriented survey
- Pooling problem: alternate formulations and solution methods
- Pruning by isomorphism in branch-and-cut
- Recent advances in the solution of quadratic assignment problems
- Reduction constraints for the global optimization of NLPs
- Reformulation and convex relaxation techniques for global optimization
- Reformulation descent applied to circle packing problems
- Reformulation in mathematical programming: An application to quantum chemistry
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Routing of uncertain traffic demands
- Semidefinite optimization
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Some transformation techniques in global optimization
- The linear complementarity problem as a separable bilinear program
- The Price of Robustness
- Tractable approximate robust geometric programming
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Writing global optimization software
Cited in
(31)- Editorial: Reformulation techniques in mathematical programming
- Reformulation in mathematical programming: An application to quantum chemistry
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
- Distance geometry and data science
- Production planning and scheduling in mining scenarios under IPCC mining systems
- Minimal conic quadratic reformulations and an optimization model
- 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
- Towards a practical theory of reformulation for reasoning about physical systems
- Mixed integer linear programming formulation techniques
- Static analysis by abstract interpretation: a mathematical programming approach
- Optimal design of electrical machines: mathematical programming formulations
- Formulation symmetries in circle packing
- Symmetry in mathematical programming
- Divisive heuristic for modularity density maximization
- Orbital independence in symmetric mathematical programs
- Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
- Linear, Integer, Separable and Fuzzy Programming Problems: A Unified Approach towards Reformulation
- scientific article; zbMATH DE number 139764 (Why is no real title available?)
- 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
- The reformulation-optimization software engine
- Random projections for linear programming: an improved retrieval phase
- An improved column generation algorithm for minimum sum-of-squares clustering
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Exploiting symmetries in mathematical programming via orbital independence
This page was built for publication: Reformulations in Mathematical Programming: Definitions and Systematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3621976)
