A branch & bound algorithm for solving one-dimensional cutting stock problems exactly
- Alternative title
-
A branch and bound algorithm for solving one-dimensional cutting stock problems exactly
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
21 cm
- Extent
-
18 S.
- Edition
-
Als Ms. gedr.
- Language
-
Deutsch
- Event
-
Veröffentlichung
- (where)
-
Dresden
- (who)
-
Technische Univ., Rektor
- (when)
-
1994
- Creator
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.03.2025, 11:52 AM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Scheithauer, Guntram
- Terno, Johannes
- Technische Univ., Rektor
Time of origin
- 1994
Other Objects (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
LaGO - a (heuristic) Branch and Cut algorithm fornonconvex MINLPs
A branch-and-bound based algorithm for nonconvex multiobjective optimization
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
LaGO - a (heuristic) Branch and Cut algorithm fornonconvex MINLPs
A branch-and-bound based algorithm for nonconvex multiobjective optimization
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
LaGO - a (heuristic) Branch and Cut algorithm fornonconvex MINLPs