Strong formulations for mixed integer programming: A survey (Q1121789): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of scheduling polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The perfectly matchable subgraph polytope of a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Formulations for Multi-Item Capacitated Lot Sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncapacitated lot-sizing: The convex hull of solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Production Planning with Concave Costs and Capacity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the symmetric travelling salesman problem: Solution of a 120-city problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cutting Plane Algorithm for the Linear Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling with integer variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities and facets of the capacitated plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using separation algorithms to generate mixed integer model reformulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral Characterization of Discrete Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid Linear Inequalities for Fixed Charge Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities and separation for capacitated economic lot sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-size models with backlogging: Strong reformulations and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities and separation for uncapacitated fixed charge networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for mixed 0-1 programs / 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 Deterministic Multi-Period Production Scheduling Model with Backlogging / rank
 
Normal rank

Revision as of 14:41, 19 June 2024

scientific article
Language Label Description Also known as
English
Strong formulations for mixed integer programming: A survey
scientific article

    Statements

    Strong formulations for mixed integer programming: A survey (English)
    0 references
    0 references
    1989
    0 references
    strong valid inequalities
    0 references
    fixed cost networks
    0 references
    survey
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references