- Sprache
-
Englisch
- Identifier
-
1251482295
- Reihe
-
Handbooks in operations research and management science
Beteiligte Personen und Organisationen
Jünger, Michael
Reinelt, Gerhard
Rinaldi, Giovanni
Reinelt, Gerhard
Rinaldi, Giovanni
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:58 MEZ
Objekttyp
- Monografie
Beteiligte
- Jünger, Michael
- Reinelt, Gerhard
- Rinaldi, Giovanni
Ähnliche Objekte (12)
Provably good solutions for the traveling salesman problem
Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization
A Polyhedral Study of Quadratic Traveling Salesman Problems
Relaxations of the Max Cut Problem and Computation of Spin Glass Ground States
Combinatorial Optimization and Integer Programming
The traveling salesman : computational solutions for TSP applications
A branch-and-cut approach to physical mapping with end-probes
Multiple social contexts of education: systematic commonalities, differences and interrelations
Exact and Heuristic Solutions to the Bandwidth Minimization Problem
The Target Visitation Problem
Link Patterns in Complex Networks
Demand forecasting for companies with many branches, low sales numbers per product, and non-recurring orderings
Provably good solutions for the traveling salesman problem
Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization
A Polyhedral Study of Quadratic Traveling Salesman Problems
Relaxations of the Max Cut Problem and Computation of Spin Glass Ground States
Combinatorial Optimization and Integer Programming
The traveling salesman : computational solutions for TSP applications
A branch-and-cut approach to physical mapping with end-probes
Multiple social contexts of education: systematic commonalities, differences and interrelations
Exact and Heuristic Solutions to the Bandwidth Minimization Problem
The Target Visitation Problem
Link Patterns in Complex Networks
Demand forecasting for companies with many branches, low sales numbers per product, and non-recurring orderings
Provably good solutions for the traveling salesman problem
Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization
A Polyhedral Study of Quadratic Traveling Salesman Problems
Relaxations of the Max Cut Problem and Computation of Spin Glass Ground States
Combinatorial Optimization and Integer Programming
The traveling salesman : computational solutions for TSP applications
A branch-and-cut approach to physical mapping with end-probes
Multiple social contexts of education: systematic commonalities, differences and interrelations
Exact and Heuristic Solutions to the Bandwidth Minimization Problem
The Target Visitation Problem
Link Patterns in Complex Networks