Combinatorial optimization. Polyhedra and efficiency (3 volumes)
From MaRDI portal
Publication:1854113
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Computational aspects related to convexity (52B55) Combinatorial aspects of matroids and geometric lattices (05B35) Hypergraphs (05C65)
Recommendations
- Combinatorial optimization -- polyhedra and efficiency: a book review
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- Polyhedral techniques in combinatorial optimization I: Theory
- Polyhedral Combinatorics in Combinatorial Optimization
- Polyhedral combinatorics and combinatorial optimization
- Polyhedral techniques in combinatorial optimization II: applications and computations
- scientific article; zbMATH DE number 5764441
- scientific article; zbMATH DE number 702975
- scientific article; zbMATH DE number 1297592
Cited in
(only showing first 100 items - show all)- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
- Recent developments in discrete convex analysis
- An introduction to network flows over time
- Snarks with resistance \(n\) and flow resistance \(2n\)
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
- A faster algorithm for packing branchings in digraphs
- Two-dimensional packing with conflicts
- Packing \(A\)-paths in group-labelled graphs via linear matroid parity
- Generating subtour elimination constraints for the TSP from pure integer solutions
- On degree sequences of undirected, directed, and bidirected graphs
- Batch processing with interval graph compatibilities between tasks
- On short paths interdiction problems: Total and node-wise limited interdiction
- Preemptive scheduling on uniform parallel machines with controllable job processing times
- On the transversal number of rank \(k\) hypergraphs
- Extended formulations for independence polytopes of regular matroids
- Path Partitions, Cycle Covers and Integer Decomposition
- Computing pure Nash and strong equilibria in bottleneck congestion games
- Packing six \(T\)-joins in plane graphs
- A two-stage decomposition of high school timetabling applied to cases in Denmark
- Polyhedra with the integer Carathéodory property
- Multi-period maintenance scheduling of tree networks with minimum flow disruption
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Integral packing of branchings in capacitaded digraphs
- The closure of a linear space in a product of lines
- On global warming: Flow-based soft global constraints
- Integer version of the multipath flow network synthesis problem
- On cardinality constrained cycle and path polytopes
- Tight bounds for linkages in planar graphs
- Minimizing the stabbing number of matchings, trees, and triangulations
- A hybrid particle swarm optimization and genetic algorithm for closed-loop supply chain network design in large-scale networks
- Matroid rank functions and discrete concavity
- Exponential lower bounds for polytopes in combinatorial optimization
- Packing in generalized kernel systems: a framework that generalizes packing of branchings
- Note on the spanning-tree packing number of lexicographic product graphs
- A cubic kernel for feedback vertex set and loop cutset
- On influence, stable behavior, and the most influential individuals in networks: a game-theoretic approach
- Facets of the \((s,t)-p\)-path polytope
- Combinatorial optimization with one quadratic term: spanning trees and forests
- The complexity of recognizing linear systems with certain integrality properties
- On minimum \(k\)-modal partitions of permutations
- Rooted \(k\)-connections in digraphs
- Security games on matroids
- The stable set polytope of quasi-line graphs
- Efficient computation of optimal auctions via reduced forms
- An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem
- The root location problem for arc-disjoint arborescences
- Modelling practical placement of trainee teachers to schools
- Notes on the deficiency-one theorem: multiple linkage classes
- Fractional packing in ideal clutters
- Existence of unimodular triangulations -- positive results
- A weighted linear matroid parity algorithm
- Clique partitioning of interval graphs with submodular costs on the cliques
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
- Stronger bounds and faster algorithms for packing in generalized kernel systems
- On the number of matroids
- Exact and approximation algorithms for weighted matroid intersection
- Maximum series-parallel subgraph
- Approximations for constructing tree-form structures using specific material with fixed length
- SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
- Packing non-zero \(A\)-paths via matroid matching
- Inverse chromatic number problems in interval and permutation graphs
- Pre-emptive scheduling problems with controllable processing times
- Approximating the maximum 2- and 3-edge-colorable subgraph problems
- Graph edge colouring: Tashkinov trees and Goldberg's conjecture
- Minimum Cuts in Surface Graphs
- An alternative approach for proving the NP-hardness of optimization problems
- Some \(0/1\) polytopes need exponential size extended formulations
- Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network
- On the existence of the positive steady states of weakly reversible deficiency-one mass action systems
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- A new multi-criteria scenario-based solution approach for stochastic forward/reverse supply chain network design
- Matching interdiction
- Extended formulations in combinatorial optimization
- The covering Canadian traveller problem
- Matroidal degree-bounded minimum spanning trees
- An \(O(n^2)\) algorithm for the limited-capacity many-to-many point matching in one dimension
- A unified approach to distance-two colouring of graphs on surfaces
- Finding nucleolus of flow game
- Copositive programming motivated bounds on the stability and the chromatic numbers
- A branch-and-bound algorithm for the acyclic partitioning problem
- Greedily constructing maximal partial \(f\)-factors
- Degree bounded matroids and submodular flows
- Arc-disjoint paths and trees in 2-regular digraphs
- On the toric ideal of a matroid
- Maximum weight independent sets in hole- and dart-free graphs
- Approximation algorithms for inventory problems with submodular or routing costs
- On the frontiers of polynomial computations in tropical geometry
- Systems of equations with a single solution
- An inductive construction of minimally rigid body-hinge simple graphs
- Generalized hypergraph matching via iterated packing and local ratio
- The stable set polytope for some extensions of \(P_4\)-free graphs
- On the complexity of reconfiguration problems
- Operations research in the space industry
- Unrelated parallel machine scheduling problem with precedence constraints: polyhedral analysis and branch-and-cut
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- On the proper orientation number of bipartite graphs
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
- Weighted matching in the semi-streaming model
- LP-based algorithms for capacitated facility location
This page was built for publication: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854113)
