|
|
|
|
LEADER |
03539nam a2200577 4500 |
001 |
978-3-540-48369-4 |
003 |
DE-He213 |
005 |
20191023222048.0 |
007 |
cr nn 008mamaa |
008 |
121227s1999 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540483694
|9 978-3-540-48369-4
|
024 |
7 |
|
|a 10.1007/3-540-48369-1
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a Q334-342
|
072 |
|
7 |
|a UYQ
|2 bicssc
|
072 |
|
7 |
|a COM004000
|2 bisacsh
|
072 |
|
7 |
|a UYQ
|2 thema
|
082 |
0 |
4 |
|a 006.3
|2 23
|
100 |
1 |
|
|a Walser, Joachim P.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
245 |
1 |
0 |
|a Integer Optimization by Local Search
|h [electronic resource] :
|b A Domain-Independent Approach /
|c by Joachim P. Walser.
|
250 |
|
|
|a 1st ed. 1999.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 1999.
|
300 |
|
|
|a XX, 144 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Artificial Intelligence ;
|v 1637
|
505 |
0 |
|
|a Frameworks for Combinatorial Optimization -- Local Search for Integer Constraints -- Case Studies Methodology -- Time-Tabling and Sports Scheduling -- Covering and Assignment -- Capacitated Production Planning -- Extensions.
|
520 |
|
|
|a 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, timetabling, radar surveillance, and sports scheduling. The monograph is written for practitioners and researchers from artificial intelligence and operations research.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Computer science-Mathematics.
|
650 |
|
0 |
|a Information technology.
|
650 |
|
0 |
|a Business-Data processing.
|
650 |
|
0 |
|a Calculus of variations.
|
650 |
1 |
4 |
|a Artificial Intelligence.
|0 http://scigraph.springernature.com/things/product-market-codes/I21000
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|0 http://scigraph.springernature.com/things/product-market-codes/I16021
|
650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|0 http://scigraph.springernature.com/things/product-market-codes/I17028
|
650 |
2 |
4 |
|a IT in Business.
|0 http://scigraph.springernature.com/things/product-market-codes/522000
|
650 |
2 |
4 |
|a Calculus of Variations and Optimal Control; Optimization.
|0 http://scigraph.springernature.com/things/product-market-codes/M26016
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783662185766
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540663676
|
830 |
|
0 |
|a Lecture Notes in Artificial Intelligence ;
|v 1637
|
856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-48369-1
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|