scientific article; zbMATH DE number 1131473
General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80) Integer programming (90C10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)
[The contributions of this volume will be announced individually.] This book presents annotated bibliographies on important topics within the field of combinatorial optimization. However, the book offers much more than a pure bibliography as each chapter provides a concise, comprehensive and fully up-to-date survey of that area. The 24 chapters, all by leading experts, cover both method and application oriented subjects. In addition there are many sections on available software and an initial chapter reviewing the most influential texts of the last decade. The contents in detail: \textit{F. Maffioli}, \textit{S. Martello}: Selected books in and around combinatorial optimization, 1-12; \textit{V. Kann}, \textit{A. Panconesi}: Hardness of approximation, 13-30; \textit{K. Aardal}, \textit{R. Weismantel}: Polyhedral combinatorics, 31-44; \textit{A. Caprara}, \textit{M. Fischetti}: Branch-and-cut algorithms, 45-64; \textit{A. Frank}: Matroids and submodular functions, 65-80; \textit{M. Conforti}, \textit{G. Cornuéjols}, \textit{A. Kapoor}, \textit{K. Vušković}: Perfect, ideal and balanced matrices, 81-94; \textit{C. Roos}, \textit{T. Terlaky}: Advances in linear optimization, 95-114; \textit{F. Soumis}: Decomposition and column generation, 115-126; \textit{L. Stougie}, \textit{M. H. van der Vlerk}: Stochastic integer programming, 127-142; \textit{M. Goemans}, \textit{D. Karger}, \textit{J. Kleinberg}: Randomized algorithms, 143-162; \textit{E. Aarts}, \textit{M. Verhoeven}: Local search, 163-180; \textit{J. A. Hoogeveen}, \textit{J. K. Lenstra}, \textit{S. L. van de Velde}: Sequencing and scheduling, 181-198; \textit{M. Jünger}, \textit{G. Reinelt}, \textit{G. Rinaldi}: The traveling salesman problem, 199-222; \textit{G. Laporte}: Vehicle routing, 223-240; \textit{M. Laurent}: Max-cut problem, 241-260; \textit{M. Labbé}, \textit{F. V. Louveaux}: Location problems, 261-282; \textit{R. K. Ahuja}: Flows and paths, 283-310; \textit{A. Balakrishnan}, \textit{T. L. Magnanti}, \textit{P. Mirchandani}: Network design, 311-334; \textit{S. Raghavan}, \textit{T. L. Magnanti}: Network connectivity, 335-354; \textit{M. Dell'Amico}, \textit{S. Martello}: Linear assignment, 355-372; \textit{R. E. Burkard}, \textit{E. Çela}: Quadratic and three-dimensional assignments, 373-392; \textit{H. Dyckhoff}, \textit{G. Scheithauer}, \textit{J. Terno}: Cutting and packing, 393-414; \textit{S. Ceria}, \textit{P. Nobili}, \textit{A. Sassano}: Set covering problem, 415-428; \textit{R. H. Möhring}, \textit{D. Wagner}: Combinatorial topics in VLSI design, 429-444; \textit{M. Vingron}, \textit{H.-P. Lenhof}, \textit{P. Mutzel}: Computational molecular biology, 445-472.
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Editorial: Combinatorial optimization: theory, computation, and applications
- An overview of advances in combinatorial optimization related topics
- scientific article; zbMATH DE number 1114459
- Preface: Combinatorial optimization and applications
- Combinatorial optimization. Theory and algorithms
- Combinatorial optimization. Theory and algorithms
- Preface: Advances in theoretical and practical combinatorial optimization
- Preface: Theory and applications in combinatorial optimization
- A lower bound for the non-oriented two-dimensional bin packing problem
- On the approximation of the minimum disturbance \(p\)-facility location problem
- Cuts, matrix completions and graph rigidity
- Cardinality constrained minimum cut problems: complexity and algorithms.
- Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope
- Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach
- Algorithms and codes for dense assignment problems: The state of the art
- Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
- A hierarchical location model for public facility planning
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- On pedigree polytopes and Hamiltonian cycles
- Models and algorithms for three-stage two-dimensional bin packing
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Packing problems in space solved by CPLEX: an experimental analysis
- DASH: dynamic approach for switching heuristics
- A continuous bi-level model for the expansion of highway networks
- scientific article; zbMATH DE number 3910135 (Why is no real title available?)
- The Boolean quadric polytope
- Model development and optimization for space engineering: concepts, tools, applications, and perspectives
- A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting
- A survey for the quadratic assignment problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4382664)