Dies ist eine Übersichtsseite mit Metadaten zu dieser wissenschaftlichen Arbeit. Der vollständige Artikel ist beim Verlag verfügbar.
Integer and Combinatorial Optimization
5.548
Zitationen
3
Autoren
1990
Jahr
Abstract
FOUNDATIONS. The Scope of Integer and Combinatorial Optimization. Linear Programming. Graphs and Networks. Polyhedral Theory. Computational Complexity. Polynomial-Time Algorithms for Linear Programming. Integer Lattices. GENERAL INTEGER PROGRAMMING. The Theory of Valid Inequalities. Strong Valid Inequalities and Facets for Structured Integer Programs. Duality and Relaxation. General Algorithms. Special-Purpose Algorithms. Applications of Special- Purpose Algorithms. COMBINATORIAL OPTIMIZATION. Integral Polyhedra. Matching. Matroid and Submodular Function Optimization. References. Indexes.
Ähnliche Arbeiten
An Efficient Heuristic Procedure for Partitioning Graphs
1970 · 5.241 Zit.
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
1987 · 4.101 Zit.
Variable neighborhood search
1997 · 4.081 Zit.
Algorithm 97: Shortest path
1962 · 3.981 Zit.
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
1964 · 3.804 Zit.