Discrete optimization / (Record no. 428488)

000 -LEADER
fixed length control field 08896cam a2201009Ia 4500
001 - CONTROL NUMBER
control field ocn227117250
003 - CONTROL NUMBER IDENTIFIER
control field OCoLC
003 - CONTROL NUMBER IDENTIFIER
control field OCoLC
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200717131828.0
006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS
fixed length control field m o d
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr bn|||||||||
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 080506s2005 ne ob 001 0 eng d
040 ## - CATALOGING SOURCE
Original cataloging agency UCW
Language of cataloging eng
Description conventions pn
Transcribing agency UCW
Modifying agency N$T
-- YDXCP
-- MERUC
-- UBY
-- E7B
-- OCLCQ
-- IDEBK
-- OCLCQ
-- OPELS
-- TEF
-- OCLCQ
-- OCLCF
-- OCLCQ
-- DEBSZ
-- UPM
-- FIE
-- OCLCQ
-- U3W
-- D6H
-- WYU
-- YOU
-- SOI
-- OCLCO
-- LEAUB
-- OCLCO
-- OCLCQ
-- DCT
-- OCLCO
-- ERF
-- OCLCO
-- WURST
-- VLY
015 ## - NATIONAL BIBLIOGRAPHY NUMBER
National bibliography number GBA476971
Source bnb
019 ## -
-- 75190863
-- 144220175
-- 441764166
-- 505057892
-- 647545753
-- 772910106
-- 1162454475
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 0444515070
Qualifying information (hbk.)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780444515070
Qualifying information (hbk.)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 0080459218
Qualifying information (electronic bk.)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780080459219
Qualifying information (electronic bk.)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 1280638117
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781280638114
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9786610638116
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 661063811X
024 3# - OTHER STANDARD IDENTIFIER
Canceled/invalid standard number or code 9780444515070
029 1# - (OCLC)
OCLC library identifier DEBSZ
System control number 414263243
029 1# - (OCLC)
OCLC library identifier GBVCP
System control number 802563775
029 1# - (OCLC)
OCLC library identifier NZ1
System control number 14675976
029 1# - (OCLC)
OCLC library identifier DEBSZ
System control number 482357983
029 1# - (OCLC)
OCLC library identifier AU@
System control number 000056660077
035 ## - SYSTEM CONTROL NUMBER
System control number (OCoLC)227117250
Canceled/invalid control number (OCoLC)75190863
-- (OCoLC)144220175
-- (OCoLC)441764166
-- (OCoLC)505057892
-- (OCoLC)647545753
-- (OCoLC)772910106
-- (OCoLC)1162454475
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA402.5
Item number .D57 2005a
072 #7 - SUBJECT CATEGORY CODE
Subject category code MAT
Subject category code subdivision 042000
Source bisacsh
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 519.6
Edition number 22
049 ## - LOCAL HOLDINGS (OCLC)
Holding library MAIN
245 00 - TITLE STATEMENT
Title Discrete optimization /
Statement of responsibility, etc. edited by K. Aardal, G.L. Nemhauser and R. Weismantel.
250 ## - EDITION STATEMENT
Edition statement 1st ed.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc. Amsterdam ;
-- Boston :
Name of publisher, distributor, etc. Elsevier,
Date of publication, distribution, etc. 2005.
300 ## - PHYSICAL DESCRIPTION
Extent 1 online resource (xi, 607 pages).
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier
347 ## - DIGITAL FILE CHARACTERISTICS
File type data file
Source rda
490 1# - SERIES STATEMENT
Series statement Handbooks in operations research and management science,
International Standard Serial Number 0927-0507 ;
Volume/sequential designation v. 12
588 0# - SOURCE OF DESCRIPTION NOTE
Source of description note Print version record.
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc Includes bibliographical references and index.
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note On the history of combinatorial optimization (till 1960) -- Computational integer programming and cutting planes -- The structure of group relaxations -- Integer programming, lattices, and results in fixed dimension -- Primal integer programming -- Balanced matrices -- Submodular function minimization -- Semidefinite programming and integer programming -- Algorithms for stochastic mixed-integer programming models -- Constraint programming.
520 ## - SUMMARY, ETC.
Summary, etc. The chapters of this Handbook volume covers nine main topics that are representative of recent theoretical and algorithmic developments in the field. In addition to the nine papers that present the state of the art, there is an article on the early history of the field. The handbook will be a useful reference to experts in the field as well as students and others who want to learn about discrete optimization. All of the chapters in this handbook are written by authors who have made significant original contributions to their topics. Herewith a brief introduction to the chapters of the handbook. "On the history of combinatorial optimization (until 1960)" goes back to work of Monge in the 18th century on the assignment problem and presents six problem areas: assignment, transportation, maximum flow, shortest tree, shortest path and traveling salesman. The branch-and-cut algorithm of integer programming is the computational workhorse of discrete optimization. It provides the tools that have been implemented in commercial software such as CPLEX and Xpress MP that make it possible to solve practical problems in supply chain, manufacturing, telecommunications and many other areas. "Computational integer programming and cutting planes" presents the key ingredients of these algorithms. Although branch-and-cut based on linear programming relaxation is the most widely used integer programming algorithm, other approaches are needed to solve instances for which branch-and-cut performs poorly and to understand better the structure of integral polyhedra. The next three chapters discuss alternative approaches. "The structure of group relaxations" studies a family of polyhedra obtained by dropping certain nonnegativity restrictions on integer programming problems. Although integer programming is NP-hard in general, it is polynomially solvable in fixed dimension. "Integer programming, lattices, and results in fixed dimension" presents results in this area including algorithms that use reduced bases of integer lattices that are capable of solving certain classes of integer programs that defy solution by branch-and-cut. Relaxation or dual methods, such as cutting plane algorithms, progressively remove infeasibility while maintaining optimality to the relaxed problem. Such algorithms have the disadvantage of possibly obtaining feasibility only when the algorithm terminates. Primal methods for integer programs, which move from a feasible solution to a better feasible solution, were studied in the 1960's but did not appear to be competitive with dual methods. However, recent development in primal methods presented in "Primal integer programming" indicate that this approach is not just interesting theoretically but may have practical implications as well. The study of matrices that yield integral polyhedra has a long tradition in integer programming. A major breakthrough occurred in the 1990's with the development of polyhedral and structural results and recognition algorithms for balanced matrices. "Balanced matrices" is a tutorial on the subject. Submodular function minimization generalizes some linear combinatorial optimization problems such as minimum cut and is one of the fundamental problems of the field that is solvable in polynomial time. "Submodular function minimization" presents the theory and algorithms of this subject. In the search for tighter relaxations of combinatorial optimization problems, semidefinite programming provides a generalization of linear programming that can give better approximations and is still polynomially solvable. This subject is discussed in "Semidefinite programming and integer programming". Many real world problems have uncertain data that is known only probabilistically. Stochastic programming treats this topic, but until recently it was limited, for computational reasons, to stochastic linear programs. Stochastic integer programming is now a high profile research area and recent developments are presented in "Algorithms for stochastic mixed-integer programming models". Resource constrained scheduling is an example of a class of combinatorial optimization problems that is not naturally formulated with linear constraints so that linear programming based methods do not work well. "Constraint programming" presents an alternative enumerative approach that is complementary to branch-and-cut. Constraint programming, primarily designed for feasibility problems, does not use a relaxation to obtain bounds. Instead nodes of the search tree are pruned by constraint propagation, which tightens bounds on variables until their values are fixed or their domains are shown to be empty.
546 ## - LANGUAGE NOTE
Language note English.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematical optimization.
9 (RLIN) 1155
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Integer programming.
9 (RLIN) 15142
650 #6 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Optimisation mathématique.
9 (RLIN) 10644
650 #6 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Programmation en nombres entiers.
9 (RLIN) 118075
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element MATHEMATICS
General subdivision Optimization.
Source of heading or term bisacsh
9 (RLIN) 20108
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Integer programming.
Source of heading or term fast
Authority record control number (OCoLC)fst00975500
9 (RLIN) 15142
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematical optimization.
Source of heading or term fast
Authority record control number (OCoLC)fst01012099
9 (RLIN) 1155
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Diskrete Optimierung
Source of heading or term gnd
9 (RLIN) 2385
653 00 - INDEX TERM--UNCONTROLLED
Uncontrolled term programmeren
653 00 - INDEX TERM--UNCONTROLLED
Uncontrolled term programming
653 00 - INDEX TERM--UNCONTROLLED
Uncontrolled term operationeel onderzoek
653 00 - INDEX TERM--UNCONTROLLED
Uncontrolled term operations research
653 00 - INDEX TERM--UNCONTROLLED
Uncontrolled term algoritmen
653 00 - INDEX TERM--UNCONTROLLED
Uncontrolled term algorithms
653 00 - INDEX TERM--UNCONTROLLED
Uncontrolled term optimalisatie
653 00 - INDEX TERM--UNCONTROLLED
Uncontrolled term optimization
653 00 - INDEX TERM--UNCONTROLLED
Uncontrolled term integer programmeren
653 00 - INDEX TERM--UNCONTROLLED
Uncontrolled term integer programming
653 00 - INDEX TERM--UNCONTROLLED
Uncontrolled term modelleren
653 00 - INDEX TERM--UNCONTROLLED
Uncontrolled term modeling
653 00 - INDEX TERM--UNCONTROLLED
Uncontrolled term discrete simulatie
653 00 - INDEX TERM--UNCONTROLLED
Uncontrolled term discrete simulation
653 10 - INDEX TERM--UNCONTROLLED
Uncontrolled term Operations Research
653 20 - INDEX TERM--UNCONTROLLED
Uncontrolled term Programming, Programming Languages
653 10 - INDEX TERM--UNCONTROLLED
Uncontrolled term Operationeel onderzoek
653 20 - INDEX TERM--UNCONTROLLED
Uncontrolled term Programmeren, programmeertalen
655 #4 - INDEX TERM--GENRE/FORM
Genre/form data or focus term Electronic books.
9 (RLIN) 396
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Aardal, K.
Fuller form of name (Karen)
Relator code edt
9 (RLIN) 15878
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Nemhauser, George L.
Relator code edt
9 (RLIN) 19796
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Weismantel, Robert.
Relator code edt
9 (RLIN) 118076
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Print version:
Title Discrete optimization.
Edition 1st ed.
Place, publisher, and date of publication Amsterdam ; Boston : Elsevier, 2005
Record control number (OCoLC)56875489
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Handbooks in operations research and management science ;
Volume number/sequential designation v. 12.
International Standard Serial Number 0927-0507
9 (RLIN) 100416
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://www.sciencedirect.com/science/handbooks/09270507/12">https://www.sciencedirect.com/science/handbooks/09270507/12</a>
938 ## -
-- ebrary
-- EBRY
-- ebr10138290
938 ## -
-- EBSCOhost
-- EBSC
-- 166624
938 ## -
-- ProQuest MyiLibrary Digital eBook Collection
-- IDEB
-- 63811
938 ## -
-- YBP Library Services
-- YANK
-- 2487445
994 ## -
-- 92
-- ATIST
Holdings
Withdrawn status Lost status Damaged status Not for loan Collection code Permanent Location Current Location Date acquired Date last seen Price effective from Koha item type
  Not Lost     EBook e-Library e-Library 2020-07-17 2020-07-17 2020-07-17 eBook

Powered by Koha