Combinatorial optimization. Theory and algorithms.
From MaRDI portal
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Discrete location and assignment (90B80) Combinatorial optimization (90C27)
This is the fourth edition of the well known advanced graduate textbook, which gives an excellent comprehensive view of the exciting field of combinatorial optimization. It is not only a revision and update of former editions, but adds some classical material (network simplex algorithms, max-cut problem) as well as recent results (f.e. local search in facility location problems) with references and exercises. For reviews of earlier editions see Zbl 0953.90052 (1st ed., 2000), Zbl 1002.90046 (2nd ed., 2002), and Zbl 1099.90054 (3rd ed., 2006). A German translation has been published in 2008 (see Zbl 1176.90501).
Recommendations
- Combinatorial optimization. Theory and applications.
- Combinatorial optimization. Theory and algorithms.
- Combinatorial optimization. Theory and algorithms. Translated from the English by R. von Randow
- Combinatorial optimization. Theory and algorithms.
- Combinatorial optimization. Theory and algorithms
Cited in
(only showing first 100 items - show all)- A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
- A simple algorithm for multicuts in planar graphs with outer terminals
- A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
- Equilibria in load balancing games
- On residual approximation in solution extension problems
- Core index of perfect matching polytope for a 2-connected cubic graph
- Combinatorial optimization problems in planning and decision making. Theory and applications
- Extended formulations for order polytopes through network flows
- Nonlinear combinatorial optimization
- Scheduling with job delivery coordination on single machine
- The hypermetric cone and polytope on eight vertices and some generalizations
- MuRoCo: a framework for capability- and situation-aware coalition formation in cooperative multi-robot systems
- Maximization of the Choquet integral over a convex set and its application to resource allocation problems
- Application of the simulated annealing local search technique to problems of redundancy elimination in functional and parametric tests of integrated circuits
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- Optimal hybrid fault recovery in a team of unmanned aerial vehicles
- Universal Gröbner basis associated with the maximum flow problem
- The representation polyhedron of a semiorder.
- Stronger instruments via integer programming in an observational study of late preterm birth outcomes
- On structured output training: hard cases and an efficient alternative
- Housing markets through graphs
- Finding the maximal adversary structure from any given access structure
- Valid inequalities for the topology optimization problem in gas network design
- Algorithms for the metric ring star problem with fixed edge-cost ratio
- Refined cut selection for Benders decomposition: applied to network capacity expansion problems
- 1-line minimum rectilinear Steiner trees and related problems
- Formal barriers to simple algorithms for the matroid secretary problem
- Subjectively interesting connecting trees and forests
- Generalised \(k\)-Steiner tree problems in normed planes
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
- The k-separator problem: polyhedra, complexity and approximation results
- An adaptive routing approach for personal rapid transit
- Sufficient pruning conditions for MINLP in gas network design
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
- On the complexity of the selective graph coloring problem in some special classes of graphs
- Privatized rural postman problems
- Affinity and fluctuations in a mesoscopic noria
- Modelling convex shape priors and matching based on the Gromov-Wasserstein distance
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty
- Combinatorial optimization. Theory and applications.
- Fast algorithms for the undirected negative cost cycle detection problem
- Steiner networks with unicyclic connected components
- On cardinality constrained polymatroids
- Using \(\mathrm{DRL}^*\) relaxations for quadratically constrained pseudoboolean optimization: application to robust Min-Cut
- A moving horizon approach to a noncontinuum state estimation
- Recoverable robust shortest path problems
- Generalized network improvement and packing problems
- Euler complexes
- A Survey on Covering Supermodular Functions
- Recent developments in discrete convex analysis
- On the relative complexity of 15 problems related to~0/1-integer programming
- An introduction to network flows over time
- A survey-based approach for designing the lines of a rapid transit network
- Connections in combinatorial optimization
- Matching polytopes and Specht modules
- Combinatorial optimization. Theory and algorithms. Translated from the English by R. von Randow
- The Expressive Power of Binary Submodular Functions
- Improved algorithms for joint optimization of facility locations and network connections
- Smoothed analysis of the successive shortest path algorithm
- Kombinatorische Optimierung
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- On total unimodularity of edge-edge adjacency matrices
- scientific article; zbMATH DE number 4083376 (Why is no real title available?)
- A note on anti-coordination and social interactions
- Three-matching intersection conjecture for perfect matching polytopes of small dimensions
- New approaches to multi-objective optimization
- Editing graphs to satisfy degree constraints: a parameterized approach
- scientific article; zbMATH DE number 1198942 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 1157223 (Why is no real title available?)
- A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
- On cardinality constrained polymatroids
- On graphs with a unique perfect matching
- Breaking thermaxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
- The Maximum Flow Problem for Oriented Flows
- Combinatorial optimization: the interplay of graph theory, linear and integer programming illustrated on network flow
- Graph editing problems with extended regularity constraints
- Approximate maximin share allocations in matroids
- A branch-and-cut algorithm for the ring spur assignment problem
- A partition-based relaxation for Steiner trees
- Virtual private network design over the first Chvátal closure
- Gems of combinatorial optimization and graph algorithms
- Combinatorial optimization. Theory and algorithms.
- Combinatorial optimization. Theory and algorithms.
- Combinatorial optimization. Theory and algorithms
- Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties
- An adaptive neurodynamic approach for solving nonsmooth \(N\)-cluster games
- On fixed-parameter solvability of the minimax path location problem
- ReLU neural networks of polynomial size for exact maximum flow computation
- On the parallel complexity of constrained read-once refutations in UTVPI constraint systems
- Graph Bipartization Problem with Applications to Via Minimization in VLSI Design
- Adjacencies on random ordering polytopes and flow polytopes
- Computing minimum cuts by randomized search heuristics
- An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
- A comparison of lower bounds for the symmetric circulant traveling salesman problem
- Nash equilibria and the price of anarchy for flows over time
- Seeking global edges for traveling salesman problem in multi-start search
- The minimum centroid branch spanning tree problem
- Bounds on the competence of a homogeneous jury
- Approximation algorithms for solving the 1-line minimum Steiner tree of line segments problem
This page was built for publication: Combinatorial optimization. Theory and algorithms.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5920350)
