Deriving compact extended formulations via LP-based separation techniques (Q5925168): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On cuts and matchings in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting Permutations by Reversals and Eulerian Cycle Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting Permutations by Reversals Through Branch-and-Price / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing cycles in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact vs. exponential-size LP relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact optimization can outperform separation: a case study in structural proteomics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4371290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of bin-packing problems using column generation and branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP models for bin packing and cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear vs. semidefinite extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for minimum routing cost trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting plane versus compact formulations for uncertain (integer) linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices with the Edmonds-Johnson property / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of large-scale symmetric travelling salesman problems / 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: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Communication Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Extended Formulations from Reflection Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time-indexed LP-based approach for min-sum job-shop problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective compact formulation of the max cut problem on sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deriving compact extended formulations via LP-based separation techniques / 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: On the Robust Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of the robust knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On compact formulations for integer programs solved by column generation / rank
 
Normal rank

Latest revision as of 08:40, 12 July 2024

scientific article; zbMATH DE number 6605543
Language Label Description Also known as
English
Deriving compact extended formulations via LP-based separation techniques
scientific article; zbMATH DE number 6605543

    Statements

    Deriving compact extended formulations via LP-based separation techniques (English)
    0 references
    0 references
    0 references
    22 July 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    compact extended formulations
    0 references
    integer linear programming
    0 references
    branch-and-cut
    0 references
    branch-and-price
    0 references
    0 references
    0 references