Stock image for illustration purposes only - book cover, edition or condition may vary.
Integer Optimization by Local Search
Joachim P. Walser
€ 63.00
FREE Delivery in Ireland
Description for Integer Optimization by Local Search
Paperback. This text details a new approach to domain-independent integer optimization, which, unlike traditional strategies, is based on local search. It develops the concepts and strategies of integer local search and describes possible combinations with classical methods from linear programming. Series: Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence. Num Pages: 144 pages, biography. BIC Classification: KJT; PBU; UMB; UYQ. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 8. Weight in Grams: 240.
Integer Optimization addresses a wide spectrum of practically important optimization problems and represents a major challenge for algorithmics. The goal of integer optimization is to solve a system of constraints and optimization criteria over discrete variables.
Integer Optimization by Local Search introduces a new approach to domain-independent integer optimization, which, unlike traditional strategies, is based on local search. It develops the central concepts and strategies of integer local search and describes possible combinations with classical methods from linear programming. The surprising effectiveness of the approach is demonstrated in a variety of case studies on large-scale, realistic problems, including production planning, ... Read more
Integer Optimization addresses a wide spectrum of practically important optimization problems and represents a major challenge for algorithmics. The goal of integer optimization is to solve a system of constraints and optimization criteria over discrete variables.
Integer Optimization by Local Search introduces a new approach to domain-independent integer optimization, which, unlike traditional strategies, is based on local search. It develops the central concepts and strategies of integer local search and describes possible combinations with classical methods from linear programming. The surprising effectiveness of the approach is demonstrated in a variety of case studies on large-scale, realistic problems, including production planning, ... Read more
Product Details
Format
Paperback
Publication date
1999
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Germany
Number of pages
144
Condition
New
Series
Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence
Number of Pages
144
Place of Publication
Berlin, Germany
ISBN
9783540663676
SKU
V9783540663676
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Integer Optimization by Local Search