A branch & bound algorithm for solving one-dimensional cutting stock problems exactly
- Weitere Titel
-
A branch and bound algorithm for solving one-dimensional cutting stock problems exactly
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
21 cm
- Umfang
-
18 S.
- Ausgabe
-
Als Ms. gedr.
- Sprache
-
Deutsch
- Ereignis
-
Veröffentlichung
- (wo)
-
Dresden
- (wer)
-
Technische Univ., Rektor
- (wann)
-
1994
- Urheber
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 13:46 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Scheithauer, Guntram
- Terno, Johannes
- Technische Univ., Rektor
Entstanden
- 1994
Ähnliche Objekte (12)
Solving an one-dimensional cutting stock problem by simulated annealing and tabu search
Branch-and-refine for solving time-dependent problems
A unified branch-and-bound and cutting plane algorithm for a class of nonconvex optimization problems : application to bilinear programming
Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization
Makanin's algorithm for solving word equations with regular constraints
An exact algorithm for solving difficult detailed routing problems
Genetic algorithm based technique for solving chance constrained problems
A new algorithm for solving dynamic stochastic macroeconomic models
The modified integer round up property of the one-dimensional cutting stock problem
Descision-Based Approaches - Descision Trees / Preprocessing / Cutting Strategies / Branch and Bound
On the relation between the extended supporting hyperplane algorithm and Kelley’s cutting plane algorithm
LaGO - a (heuristic) Branch and Cut algorithm fornonconvex MINLPs
Solving an one-dimensional cutting stock problem by simulated annealing and tabu search
Branch-and-refine for solving time-dependent problems
A unified branch-and-bound and cutting plane algorithm for a class of nonconvex optimization problems : application to bilinear programming
Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization
Makanin's algorithm for solving word equations with regular constraints
An exact algorithm for solving difficult detailed routing problems
Genetic algorithm based technique for solving chance constrained problems
A new algorithm for solving dynamic stochastic macroeconomic models
The modified integer round up property of the one-dimensional cutting stock problem
Descision-Based Approaches - Descision Trees / Preprocessing / Cutting Strategies / Branch and Bound
On the relation between the extended supporting hyperplane algorithm and Kelley’s cutting plane algorithm
LaGO - a (heuristic) Branch and Cut algorithm fornonconvex MINLPs
Solving an one-dimensional cutting stock problem by simulated annealing and tabu search
Branch-and-refine for solving time-dependent problems
A unified branch-and-bound and cutting plane algorithm for a class of nonconvex optimization problems : application to bilinear programming
Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization
Makanin's algorithm for solving word equations with regular constraints
An exact algorithm for solving difficult detailed routing problems
Genetic algorithm based technique for solving chance constrained problems
A new algorithm for solving dynamic stochastic macroeconomic models
The modified integer round up property of the one-dimensional cutting stock problem
Descision-Based Approaches - Descision Trees / Preprocessing / Cutting Strategies / Branch and Bound
On the relation between the extended supporting hyperplane algorithm and Kelley’s cutting plane algorithm