Christos Papadimitriou - Combinatorial - Optimization - Algorithms - and - Complexity PDF
Christos Papadimitriou - Combinatorial - Optimization - Algorithms - and - Complexity PDF
Christos Papadimitriou - Combinatorial - Optimization - Algorithms - and - Complexity PDF
net/publication/220695898
CITATIONS READS
4,758 20,467
2 authors, including:
Kenneth Steiglitz
Princeton University
239 PUBLICATIONS 12,585 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
All content following this page was uploaded by Kenneth Steiglitz on 27 May 2014.
CHRISTOS H. PAPADIMITRIOU
University of California-Berkeley
KENNETH STEIGLITZ
Princeton University
TU Darmstadt
FBETiT
1008675
Contents
PREFACE xv
1.1 Introduction 1
1.2 Optimization Problems 3
1.3 Neighborhoods 7
1.4 Local and Global Optima 8
1.5 Convex Sets and Functions 10
1.6 Convex Programming Problems 13
Problems 16
Notes and References 17
Appendix: Terminology and Notation 19
A.1 Linear Algebra 19
A.2 Graph Theory 20
A.3 Pidgin Algol 24
iii
iv CONTENTS
Chapter 3 DUALITY 67
Chapter 18 BRANCH-AND-BOUND
AND DYNAMIC PROGRAMMING 433
18.1 Branch-and-Bound for Integer Linear Programming 433
18.2 Branch-and-Bound in a General Context 438
18.3 Dominance Relations 442
18.4 Branch-and-Bound Strategies 443
18.5 Application to a Flowshop Scheduling Problem 444
18.6 Dynamic Programming 448
Problems 451
Notes and References 452
INDEX 487
View publication