close
1.

図書
図書
1. Integer optimization by local search : a domain-independent approach
Joachim Paul Walser ; foreword by Henry Kautz
出版情報: Berlin ; Tokyo : Springer-Verlag, c1999  xv, 137 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1637 . Lecture notes in artificial intelligence
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Integer Optimization and Heuristics / 1.1：
Integer Local Search / 1.2：
Experimental Results / 1.3：
Research Contributions / 1.4：
Frameworks for Combinatorial Optimization / 2：
Integer Programming Branch- and- Bound / 2.1：
Finite Domain Constraint Programming / 2.2：
Local Search / 2.3：
Meta- heuristics / 2.3.1：
RISC and CISC Local Search / 2.3.2：
Local Search for SAT / 2.3.3：
Application Domains of SAT Local Search / 2.3.4：
Modeling Languages / 2.4：
Search Relaxations and Integer Local Search / 2.5：
Local Search for Integer Constraints / 3：
Over- Constrained Integer Programs / 3.1：
Definition / 3.1.1：
Relation to Integer Linear Programs / 3.1.2：
Constraint-Bounds / 3.1.3：
Integer Local Search: Wsat(oip) / 3.2：
The Score / 3.2.1：
The Main Loop / 3.2.2：
Move Selection and Tabu Search Extensions / 3.2.3：
Combinations with Linear Programming / 3.3：
Bounds from LP Relaxations / 3.3.1：
Initialization by Rounding LP Solutions / 3.3.2：
Search Space Reduction Using LP Reduced Costs / 3.3.3：
Implementation Issues / 3.3.4：
A Graphical Interpretation / 3.4：
Related Work / 3.5：
Integer Programming Heuristics / 3.5.1：
Local Search in Constraint Satisfaction / 3.5.2：
Summary / 3.6：
Case Studies Methodology / 4：
Optimization in Practice: Criteria of Success / 4.1：
Scaling with Increasing Problem Size / 4.1.1：
Scaling with Increasing Constrainedness / 4.1.2：
Flexibility and Residual Robustness / 4.1.3：
The Problem Class Selection / 4.2：
The Empirical Comparisons / 4.3：
Time-Tabling and Sports Scheduling / 5：
The Progressive Party Problem / 5.1：
Problem Description and Formulation / 5.1.1：
Experimental Results and Comparison / 5.1.2：
The ACC Basketball Scheduling Problem / 5.2：
Double Round Robin Scheduling / 5.2.1：
Problem Specification of ACC97/98 / 5.2.2：
Integer Local Search Formulation / 5.2.3：
Redundant Constraints / 5.2.4：
Previous (Multi- stage) Approaches / 5.2.5：
Experimental Results under Varied Constrainedness / 5.2.6：
Minimal Distortion Mirroring / 5.2.7：
Conclusions / 5.3：
Covering and Assignment / 6：
Radar Surveillance Covering / 6.1：
Experimental Results under Varied Problem Size / 6.1.1：
Course Assignment / 6.2：
A Related Application: Reviewer Assignment / 6.2.1：
Capacitated Production Planning / 6.3：
Capacitated Lot- Sizing / 7.1：
Mixed Integer Programming Formulation / 7.2：
Lagrangean Relaxation Approach / 7.3.1：
Restricting the Problem / 7.3.2：
Comparison of Results / 7.4：
Lower Bounds / 7.4.2：
Extensions / 7.5：
Current Limitations / 8.1：
An Alternative Scoring Scheme / 8.2：
Future Research / 8.3：
A Complete AMPL Model for ACC97/98 / 8.4：
References
Index
Introduction / 1：
Integer Optimization and Heuristics / 1.1：
Integer Local Search / 1.2：
2.

図書
図書
2. Combinatorial optimization
William J. Cook ... [et al.]
出版情報: New York : Wiley, c1998  x, 355 p. ; 25 cm
シリーズ名: Wiley-Interscience series in discrete mathematics and optimization
所蔵情報: loading…
目次情報: 続きを見る
Problems and Algorithms
Optimal Trees and Paths
Maximum Flow Problems
Minimum-Cost Flow Problems
Optimal Matchings
Integrality of Polyhedra
The Traveling Salesman Problem
Matroids
NP and NP-Completeness
Appendix
Bibliography
Index
Problems and Algorithms
Optimal Trees and Paths
Maximum Flow Problems
3.

図書
図書
3. Graphs, networks and algorithms
Dieter Jungnickel
出版情報: Berlin ; Tokyo : Springer, c1999  xii, 589 p. ; 24 cm
シリーズ名: Algorithms and computation in mathematics ; v. 5
所蔵情報: loading…
4.

図書
図書
4. Probability theory and combinatorial optimization (: pbk)
J. Michael Steele
出版情報: Philadelphia : Society for Industrial and Applied Mathematics, c1997  viii, 159 p. ; 25 cm
シリーズ名: CBMS-NSF regional conference series in applied mathematics ; 69
所蔵情報: loading…
目次情報: 続きを見る
Preface
First View of Problems and Methods / Chapter 1：
A first example: Long common subsequences
Subadditivity and expected values
AzumaG++s inequality and a first application
A second example: The increasing-subsequence problem
Flipping AzumaG++s inequality
Concentration on rates
Dynamic programming
KingmanG++s subadditive ergodic theorem
Observations on subadditive subsequences
Additional notes
Concentration of Measure and the Classical Theorems / Chapter 2：
The TSP and quick application of AzumaG++s inequality
Easy size bounds
Another mean Poissonization
The Beardwood-Halton-Hammersly theorem
KarpG++s partitioning algorithms
Introduction to space-filling curve heuristic
Asymptotics for the space-filling curve heuristic
More General Methods / Chapter 3：
Subadditive Euclidean functionals
Examples: Good, bad and forthcoming
A general L-(infinity) bound
Simple subadditivity and geometric subadditivity
A concentration inequality
Minimal matching
Two-sided bounds and first consequences
Rooted duals and their applications
Lower bounds and best possibilities
Additional remarks
Probability in Greedy Algorithms and Linear Programming / Chapter 4：
Assignment problem
Simplex method for theoreticians
Dyer-Frieze-McDiarmid inequality
Dealing with integral constraints
Distributional bounds
Back to the future
Distributional Techniques and the Objective Method / Chapter 5：
Motivation for a method
Searching for a candidate object
Topology for nice sets
Information on the infinite tree
D+1/4noument
Central limit theory
Conditioning method for independence
Dependency graphs and the CLT
TalagrandG++s Isoperimetric Theory / Chapter 6：
TalagrandG++s isoperimetric theory
Two geometric applications of the isoperimetric inequality
Application to the longest-increasing-subsequence problem
Proof of the isoperimetric problem
Application and comparison in the theory of hereditary sets
Suprema of linear functionals
Tail of the assignment problem
Further applications of TalagrandG++s isoperimetric inequalities
Final considerations on related work
Bibliography
Index
Preface
First View of Problems and Methods / Chapter 1：
A first example: Long common subsequences
5.

図書
図書
5. Bayesian heuristic approach to discrete and global optimization : algorithms, visualization, software, and applications
by Jonas Mockus ... [et al.]
出版情報: Dordrecht : Kluwer Academic Publishers, c1997  xv, 396 p. ; 25 cm
シリーズ名: Nonconvex optimization and its applications ; v. 17
所蔵情報: loading…
6.

図書
図書
6. Combinatorial optimization for undergraduates (: us ; : gw)
L.R. Foulds
出版情報: New York : Springer-Verlag, c1984  xii, 227 p. ; 25 cm
シリーズ名: Undergraduate texts in mathematics
所蔵情報: loading…
7.

図書
図書
7. Linear and combinatorial optimization in ordered algebraic structures
U. Zimmermann
出版情報: Amsterdam : North-Holland Pub. Co. , New York : sole distributors for the U.S.A. and Canada, Elsevier North-Holland, 1981  ix, 380 p. ; 25 cm
シリーズ名: Annals of discrete mathematics ; 10
所蔵情報: loading…
8.

図書
図書
8. The Traveling salesman problem : a guided tour of combinatorial optimization
edited by E.L. Lawler ... [et al.]
出版情報: Chichester [West Sussex] ; New York : Wiley, c1985  x, 465 p. ; 25 cm
シリーズ名: Wiley-Interscience series in discrete mathematics
所蔵情報: loading…
目次情報: 続きを見る
History / A. Hoffman ; P. Wolfe
Motivation and Modeling / R. Garfinkel
Computational Complexity / D. Johnson ; C. Papadimitriou
Well-Solved Special Cases / P. Gilmore, et al.
Performance Guarantees for Heuristics
Probabilistic Analysis of Heuristics / R. Karp ; J. Steele
Empirical Analysis of Heuristics / B. Golden ; W. Stewart
Polyhedral Theory / M. Grotschel ; M. Padberg
Polyhedral Algorithms
Branch and Bound Methods / E. Balas ; P. Toth
Hamiltonian Cycles / V. Chvatal
Vehicle Routing / N. Christofides
Bibliography
History / A. Hoffman ; P. Wolfe
Motivation and Modeling / R. Garfinkel
Computational Complexity / D. Johnson ; C. Papadimitriou
9.

図書
図書
9. Surveys in combinatorial optimization
edited by Silvano Martello ... [et al.]
出版情報: Amsterdam ; Tokyo : North-Holland, 1987  ix, 384 p. ; 24 cm
シリーズ名: North-Holland mathematics studies ; 132
Annals of discrete mathematics ; 31
所蔵情報: loading…
10.

図書
図書
10. Genetic algorithms and robotics : a heuristic strategy for optimization
Yuval Davidor
出版情報: Singapore ; Teaneck, NJ : World Scientific, c1991  xiv, 164 p. ; 23 cm
シリーズ名: World Scientific series in robotics and automated systems ; 1
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼