scientific article; zbMATH DE number 3862930

MaRDI QIDQ3330973zbMATH OpenFDO

Authors Alexander Schrijver

Publication date 1983

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

Cited in

(only showing first 100 items - show all)

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

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)