Combinatorial optimization. Polyhedra and efficiency (3 volumes)

No author found.

Publication date: 27 January 2003

Published in: Algorithms and Combinatorics (Search for Journal in Brave)

combinatorial optimization polyhedral combinatorics efficient algorithms

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Computational aspects related to convexity (52B55) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (only showing first 100 items - show all)

Optimum matchings in weighted bipartite graphs ⋮ Zonotopal algebra and forward exchange matroids ⋮ Non-archimedean valuations of eigenvalues of matrix polynomials ⋮ On the diameter of cut polytopes ⋮ Weighted digraphs and tropical cones ⋮ Edge-disjoint odd cycles in 4-edge-connected graphs ⋮ House-swapping with divorcing and engaged pairs ⋮ Core-based criterion for extreme supermodular functions ⋮ Equistarable bipartite graphs ⋮ Deciding probabilistic automata weak bisimulation: theory and practice ⋮ On the diameter of lattice polytopes ⋮ Robust probability updating ⋮ Parameter-free sampled fictitious play for solving deterministic dynamic programming problems ⋮ Approximation algorithms for stochastic combinatorial optimization problems ⋮ Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming ⋮ Optimal cost sharing for capacitated facility location games ⋮ Edge-disjoint rainbow spanning trees in complete graphs ⋮ The complexity of finding arc-disjoint branching flows ⋮ A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges ⋮ A survey on flows in graphs and matroids ⋮ An inductive construction of minimally rigid body-hinge simple graphs ⋮ Matroid and knapsack center problems ⋮ Modelling practical placement of trainee teachers to schools ⋮ Stronger bounds and faster algorithms for packing in generalized kernel systems ⋮ On the number of matroids ⋮ Approximations for constructing tree-form structures using specific material with fixed length ⋮ Packing non-zero \(A\)-paths via matroid matching ⋮ Inverse chromatic number problems in interval and permutation graphs ⋮ An alternative approach for proving the NP-hardness of optimization problems ⋮ Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network ⋮ A new multi-criteria scenario-based solution approach for stochastic forward/reverse supply chain network design ⋮ An \(O(n^2)\) algorithm for the limited-capacity many-to-many point matching in one dimension ⋮ A branch-and-bound algorithm for the acyclic partitioning problem ⋮ A two-stage decomposition of high school timetabling applied to cases in Denmark ⋮ Extended formulations for independence polytopes of regular matroids ⋮ Approximation algorithms for inventory problems with submodular or routing costs ⋮ Irrelevant vertices for the planar disjoint paths problem ⋮ On discrete optimization with ordering ⋮ Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter ⋮ Computing pure Nash and strong equilibria in bottleneck congestion games ⋮ On generalizations of network design problems with degree bounds ⋮ Testing additive integrality gaps ⋮ Lifted generalized permutahedra and composition polynomials ⋮ A bilevel programming problem with maximization of a supermodular function in the lower level ⋮ Edge-colouring and total-colouring chordless graphs ⋮ Three-matching intersection conjecture for perfect matching polytopes of small dimensions ⋮ Majorization for partially ordered sets ⋮ A game generalizing Hall's theorem ⋮ Oriented hypergraphs: introduction and balance ⋮ A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees ⋮ On the polyhedral structure of uniform cut polytopes ⋮ Characterizing and recognizing generalized polymatroids ⋮ New approaches to multi-objective optimization ⋮ Thresholded covering algorithms for robust and max-min optimization ⋮ Combinatorial optimization with one quadratic term: spanning trees and forests ⋮ Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices ⋮ Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms ⋮ Minimum \(d\)-blockers and \(d\)-transversals in graphs ⋮ Optimality conditions for a bilevel matroid problem ⋮ Tree-representation of set families and applications to combinatorial decompositions ⋮ Coloring fuzzy circular interval graphs ⋮ Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences ⋮ Series-parallel orientations preserving the cycle-radius ⋮ Bonds with parity constraints ⋮ On flows in simple bidirected and skew-symmetric networks ⋮ Packing cycles exactly in polynomial time ⋮ Immersing complete digraphs ⋮ Aggregation of monotone reciprocal relations with application to group decision making ⋮ Solving VLSI design and DNA sequencing problems using bipartization of graphs ⋮ The \(k\) edge-disjoint 3-hop-constrained paths polytope ⋮ Cutting stock with no three parts per pattern: work-in-process and pattern minimization ⋮ Online variable-sized bin packing with conflicts ⋮ On claw-free \(t\)-perfect graphs ⋮ Fractional packing in ideal clutters ⋮ Notes on the deficiency-one theorem: multiple linkage classes ⋮ Ideal multipartite secret sharing schemes ⋮ Operations research in the space industry ⋮ On the complexity of the Eulerian closed walk with precedence path constraints problem ⋮ The root location problem for arc-disjoint arborescences ⋮ Bounded fractionality of the multiflow feasibility problem for demand graph \(K_3 + K_3\) and related maximization problems ⋮ On the computational complexity of membership problems for the completely positive cone and its dual ⋮ Hamilton cycles in dense vertex-transitive graphs ⋮ An algorithm for weighted fractional matroid matching ⋮ Tree metrics and edge-disjoint \(S\)-paths ⋮ Certifying algorithms ⋮ Spectral bounds for the independence ratio and the chromatic number of an operator ⋮ Exact and asymptotic results on coarse Ricci curvature of graphs ⋮ Polyhedral study of the connected subgraph problem ⋮ Criticality for multicommodity flows ⋮ Belief propagation for optimal edge cover in the random complete graph ⋮ A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching ⋮ On packing arborescences in temporal networks ⋮ Systems of equations with a single solution ⋮ Handelman's hierarchy for the maximum stable set problem ⋮ On the proper orientation number of bipartite graphs ⋮ Assigning agents to a line ⋮ Towards optimal and expressive kernelization for \(d\)-hitting set ⋮ Resource buying games ⋮ Degree-constrained graph orientation: maximum satisfaction and minimum violation ⋮ Combinatorial EM algorithms

This page was built for publication: Combinatorial optimization. Polyhedra and efficiency (3 volumes)