scientific article; zbMATH DE number 3862930

zbMATH Open0542.90067MaRDI QIDQ3330973FDOQ3330973

Authors: Alexander Schrijver 

Publication date: 1983

Title of this publication is not available (Why is that?)

Recommendations

• Minmax combinatorial optimization
• scientific article; zbMATH DE number 895371
• Solution of combinatorial optimization problems with minimax criterion
• Min-max-min robust combinatorial optimization
• scientific article; zbMATH DE number 912372
• Solving combinatorial problems with combined min-max-min-sum objective and applications
• scientific article; zbMATH DE number 1923167
• On combined minmax-minsum optimization
• Min-max optimization of several classical discrete optimization problems
• Minimum entropy combinatorial optimization problems

zbMATH Keywords

surveynetwork flowsmax-flow min-cut theorembipartite graphsmatchingsmatroidstotal dual integralityperfect graphsmulticommodity flowstotal unimodularitydirected cutsblockerssubmodular functionsarborescencescluttersblocking and anti-blocking polyhedraMin-max relations in combinatorial optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10) Combinatorial aspects of matroids and geometric lattices (05B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (only showing first 100 items - show all)

• The uniqueness property for networks with several origin-destination pairs
• A one-to-one correspondence between colorings and stable sets
• The generalized assignment problem with minimum quantities
• On the cycle polytope of a binary matroid
• The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect
• Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems
• A reduction approach to the repeated assignment problem
• Equality of ordinary and symbolic powers of Stanley-Reisner ideals
• A comparison of lower bounds for the symmetric circulant traveling salesman problem
• Cohen-Macaulayness of monomial ideals and symbolic powers of Stanley-Reisner ideals
• Cohen-Macaulayness of large powers of Stanley-Reisner ideals
• Spectral methods for graph clustering - a survey
• Integral polyhedra related to integer multicommodity flows on a cycle
• The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect
• Crown reductions for the minimum weighted vertex cover problem
• A short proof of the tree-packing theorem
• Paintshop, odd cycles and necklace splitting
• Complexity and approximation of the constrained forest problem
• Integrality properties of edge path tree families
• The generic rank of body-bar-and-hinge frameworks
• A characterization of the 2-additive Choquet integral through cardinal information
• Replication in critical graphs and the persistence of monomial ideals
• Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
• A competitive partnership formation process
• Directed submodularity, ditroids and directed submodular flows
• A transitivity analysis of bipartite rankings in pairwise multi-class classification
• Strengthening topological colorful results for graphs
• Shellable graphs and sequentially Cohen-Macaulay bipartite graphs
• A survey on flows in graphs and matroids
• On a cardinality-constrained transportation problem with market choice
• In search of the densest subgraph
• Brick partitions of graphs
• On box-perfect graphs
• Fast approximation for computing the fractional arboricity and extraction of communities of a graph
• Matching theory -- a sampler: From Dénes König to the present
• Multicommodity flows in cycle graphs
• 2-clique-bond of stable set polyhedra
• The \(d\)-dimensional rigidity matroid of sparse graphs
• On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
• Polyhedral proof methods in combinatorial optimization
• Conspiracy numbers for min-max search
• Min-max-min robust combinatorial optimization
• The stable set polytope of icosahedral graphs
• Packing cycles in graphs
• Free multiflows in bidirected and skew-symmetric graphs
• Minmax relations for cyclically ordered digraphs
• The complexity of recursive constraint satisfaction problems
• Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound
• Perfectness and imperfectness of unit disk graphs on triangular lattice points
• Coloring by two-way independent sets
• Shared processor scheduling of multiprocessor jobs
• Edge-disjoint paths in planar graphs
• A model predictive control approach for discrete-time rescheduling in complex central railway station areas
• Polyhedral results for a vehicle routing problem
• A weighted min-max relation for intervals
• On combined minmax-minsum optimization
• The edge covering number of the intersection of two matroids
• The joy of implications, aka pure Horn formulas: mainly a survey
• A note on matchings and separability
• A dichotomy for minimum cost graph homomorphisms
• Blocking and Antiblocking Polyhedra
• On \(0,\pm 1\) matrices, odd vectors, and bisubmodular polyhedra
• A relax-and-cut algorithm for the set partitioning problem
• Title not available (Why is that?)
• Derandomization of auctions
• Fast approximation of matroid packing and covering
• A new contraction technique with applications to congruency-constrained cuts
• A duality theorem for the ic-resurgence of edge ideals
• Orientations and detachments of graphs with prescribed degrees and connectivity
• Approximate multi-matroid intersection via iterative refinement
• Multi-objective matroid optimization with ordinal weights
• Independent-set reconfiguration thresholds of hereditary graph classes
• An LP-based heuristic algorithm for the node capacitated in-tree packing problem
• Title not available (Why is that?)
• Ordered weighted average optimization in multiobjective spanning tree problem
• On node constraint networks
• Uniform and monotone line sum optimization
• Title not available (Why is that?)
• Polyhedral clinching auctions for indivisible goods
• On the independent dominating set polytope
• Some formulations for the group Steiner tree problem
• Note on maximal split-stable subgraphs
• Title not available (Why is that?)
• On partitioning two matroids into common independent subsets
• Compression with wildcards: all exact or all minimal hitting sets
• Perfect graphs with polynomially computable kernels
• New proofs of Konig-Egervary theorem and maximal flow-minimal cut capacity theorem using O.R. techniques
• Maximum flow under proportional delay constraint
• The complexity of vector partition
• Connections in combinatorial optimization. I: optimization in graphs
• The parity Hamiltonian cycle problem
• Max-multiflow/min-multicut for G+H series-parallel
• An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality
• Shifted matroid optimization
• Cache me if you can: capacitated selfish replication games in networks
• Rees algebras of filtrations of covering polyhedra and integral closure of powers of monomial ideals
• Maximum balanced flow in a network
• A perfect secret sharing scheme for general access structures
• A multivariate framework for weighted FPT algorithms
• Upper and lower degree-constrained graph orientation with minimum penalty

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3330973)