Solving combinatorial problems with combined min-max-min-sum objective and applications
DOI10.1007/BF01589111zbMath0682.90076MaRDI QIDQ1824562
Publication date: 1989
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
matchingsmatroid intersectionbicriterion analysislinear cost functionweighted edge coloringbottleneck cost function
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)
Related Items (18)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- A simple version of Karzanov's blocking flow algorithm
- Most and least uniform spanning trees
- Matroid Intersection
- Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation
- A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
- Maximum matching and a polyhedron with 0,1-vertices
- Matroids and the greedy algorithm
This page was built for publication: Solving combinatorial problems with combined min-max-min-sum objective and applications