Integer Optimization by Local Search A Domain-Independent Approach /

• Κύριος συγγραφέας: Walser, Joachim P. (Συγγραφέας, http://id.loc.gov/vocabulary/relators/aut)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
• Έκδοση: 1st ed. 1999.
• Σειρά: Lecture Notes in Artificial Intelligence ; 1637
• Θέματα: Artificial intelligence.; Algorithms.; Computer science-Mathematics.; Information technology.; Business-Data processing.; Calculus of variations.; Artificial Intelligence.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; IT in Business.; Calculus of Variations and Optimal Control; Optimization.

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 Searc...

Πίνακας περιεχομένων:

• Frameworks for Combinatorial Optimization
• Local Search for Integer Constraints
• Case Studies Methodology
• Time-Tabling and Sports Scheduling
• Covering and Assignment
• Capacitated Production Planning
• Extensions.