Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
From MaRDI portal
Publication:761351
DOI10.1007/BF02579139zbMath0555.90080OpenAlexW2088221897MaRDI QIDQ761351
László Lovász, Martin Grötschel, Alexander Schrijver
Publication date: 1984
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579139
Related Items
A Polytope for a Product of Real Linear Functions in 0/1 Variables, On the complexity of some basic problems in computational convexity. I. Containment problems, Note on separation from membership, and folklore, The stable fixtures problem with payments, Structure of squares and efficient domination in graph classes, Fixed interval scheduling: models, applications, computational complexity and algorithms, Minimizing submodular functions over families of sets, Co-density and fractional edge cover packing, Advances on strictly \(\varDelta \)-modular IPs, Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center, Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences, Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model, On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets, Weighted efficient domination in two subclasses of \(P_6\)-free graphs, Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs, A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs, Unnamed Item, Densities, Matchings, and Fractional Edge-Colorings, On search over rationals, Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs, Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus, On cycle cones and polyhedra, Transitive packing, An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations, The separation problem of rounded capacity inequalities: some polynomial cases, Bounded vertex colorings of graphs, Projection algorithms for linear programming, Duality for balanced submodular flows, Algorithms for unipolar and generalized split graphs, A new contraction technique with applications to congruency-constrained cuts, Minimization of locally defined submodular functions by optimal soft arc consistency, Graphs and Algorithms in Communication Networks on Seven League Boots, A family of easy polyhedra, Twin-width and polynomial kernels, Explicit Near-Ramanujan Graphs of Every Degree
Cites Work
