Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SNOPT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: XPRESS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GAMS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2100581751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances in the solution of quadratic assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Links between linear bilevel and mixed 0-1 programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pooling Problem: Alternate Formulations and Solution Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the choice of explicit stabilizing terms in column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing of uncertain traffic demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bilevel programming. I: General nonlinear cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a new class of bilevel programming problems and its use for reformulating mixed integer problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linearization framework for unconstrained quadratic (0-1) problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Miniaturized'' linearizations for quadratic 0/1 problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing global minima to polynomial optimization problems using Gröbner bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of Nonlinear 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convexification of nonlinear programming problems: An applications-oriented survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable approximate robust geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior point potential reduction algorithm for the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4817248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction constraints for the global optimization of NLPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulation and convex relaxation techniques for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearity embedded in nonconvex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact linearization for binary quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Generation of Symmetry-Breaking Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex envelopes of monomials of odd degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization. From theory to implementation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulation in mathematical programming: An application to quantum chemistry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear complementarity problems solvable by A single linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear complementarity problem as a separable bilinear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pruning by isomorphism in branch-and-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting orbits in symmetric ILP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulation descent applied to circle packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation and decomposition methods for mixed integer nonlinear programming. / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP reformulations of the probabilistic set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of nonconvex polynomial programming problems having rational exponents / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new reformulation-linearization technique for bilinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Discrete Model Representations via Symmetry Considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of nonconvex factorable programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems with d.c.-contraints. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and sum decomposition of vertex polyhedral convex envelopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex extensions and envelopes of lower semi-continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Mixed Integer Programming Problems Using Automatic Reformulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multivariate global optimization using linear bounding functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank

Latest revision as of 12:41, 1 July 2024

scientific article
Language Label Description Also known as
English
Reformulations in Mathematical Programming: Definitions and Systematics
scientific article

    Statements

    Reformulations in Mathematical Programming: Definitions and Systematics (English)
    0 references
    0 references
    0 references
    23 April 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    reformulation
    0 references
    formulation
    0 references
    model
    0 references
    linearization
    0 references
    mathematical program
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references