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)

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

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)