Extended formulations in combinatorial optimization (Q5919994): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems / 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: The perfectly matchable subgraph polytope of an arbitrary graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cuts and matchings in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing Matching to Polynomial Size Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Polyhedral Approximations of the Second-Order Cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate formulations for 0-1 knapsack sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tightening simple mixed-integer sets with guaranteed bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact formulations as a union of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral Approaches to Mixed Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Formulations of Mixed-Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Quantum Query and Communication Complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching, Euler tours and the Chinese postman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Formulations for Packing and Partitioning Orbitopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear vs. semidefinite extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations for polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stable set polyhedra for K//(1,3)free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of weakly bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing mixed-integer inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On defining sets of vertices of the hypercube by linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branched Polyhedral Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Extended Formulations from Reflection Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and partitioning orbitopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry Matters for the Sizes of Extended Formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral Characterization of Discrete Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of optimal solutions to integer and mixed-integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight formulations for some simple mixed integer programs and convex objective integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedra for lot-sizing with Wagner-Whitin costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production Planning by Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Continuous Mixing Polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Nonnegative Matrix Factorization / 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: Lectures on Polytopes / rank
 
Normal rank

Latest revision as of 18:24, 6 July 2024

scientific article; zbMATH DE number 6196475
Language Label Description Also known as
English
Extended formulations in combinatorial optimization
scientific article; zbMATH DE number 6196475

    Statements

    Extended formulations in combinatorial optimization (English)
    0 references
    0 references
    0 references
    0 references
    8 August 2013
    0 references
    0 references
    combinatorial optimization polyhedral combinatorics
    0 references
    extended formulations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references