Jünger, Michael and Reinelt, Gerhard
(2001).
Combinatorial Optimization and Integer Programming.
Oxford: Eolss Publishers.
|
PDF
zaik2001-416.pdf Download (133kB) | Preview |
Abstract
Solution techniques for combinatorial optimization and integer programming problems are core disciplines in operations research with contributions of mathematicians as well as computer scientists and economists. This article surveys the state of the art in solving such problems to optimality.
| Item Type: | Other | ||||||||||||
| Creators: |
|
||||||||||||
| URN: | urn:nbn:de:hbz:38-548582 | ||||||||||||
| Date: | 2001 | ||||||||||||
| Publisher: | Eolss Publishers | ||||||||||||
| Place of Publication: | Oxford | ||||||||||||
| Language: | English | ||||||||||||
| Faculty: | Faculty of Mathematics and Natural Sciences | ||||||||||||
| Divisions: | Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science | ||||||||||||
| Subjects: | Data processing Computer science | ||||||||||||
| URI: | http://kups.ub.uni-koeln.de/id/eprint/54858 |
Downloads
Downloads per month over past year
Export
Actions (login required)
 |
View Item |