Combinatorial Optimization. Polyhedra and efficiency. CD-ROM

Publication date: 12 October 2004

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

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

Cardinality constraints and systems of restricted representatives ⋮ Oriented hypergraphs: balanceability ⋮ Graph realizations constrained by skeleton graphs ⋮ Submodularity and its application to some global constraints ⋮ A spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphs ⋮ Congestion Games with Complementarities ⋮ Unnamed Item ⋮ Random Walks in Polytopes and Negative Dependence ⋮ Polymatroid Prophet Inequalities ⋮ Enhancing complex network controllability by minimum link direction reversal ⋮ Structural identifiability in low-rank matrix factorization ⋮ Envy-free pricing with general supply constraints for unit demand consumers ⋮ The signed $k$-submatchings in graphs ⋮ Approximate generalized matching: $f$-matchings and $f$-edge covers ⋮ Submodular Functions: Learnability, Structure, and Optimization ⋮ Approximating activation edge-cover and facility location problems ⋮ On finite linear systems containing strict inequalities ⋮ On the tree augmentation problem ⋮ Reduced-form budget allocation with multiple public alternatives ⋮ Complexity classification of the edge coloring problem for a family of graph classes ⋮ On the combinatorics of Galois numbers ⋮ A ${(1+\ln 2)}$-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius ⋮ Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs ⋮ Combing a Linkage in an Annulus ⋮ Streaming graph computations with a helpful advisor ⋮ Approximating directed weighted-degree constrained networks ⋮ A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs ⋮ Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows ⋮ Models for the single-vehicle preemptive pickup and delivery problem ⋮ Packing $k$-Matchings and $k$-Critical Graphs ⋮ Cardinality constrained combinatorial optimization: complexity and polyhedra ⋮ Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor ⋮ LP-relaxations for tree augmentation ⋮ Finding an optimal Nash equilibrium to the multi-agent project scheduling problem ⋮ On facet-inducing inequalities for combinatorial polytopes ⋮ Small $\ell$-edge-covers in $k$-connected graphs ⋮ On sum edge-coloring of regular, bipartite and split graphs ⋮ Combinatorial optimization problems in wireless switch design ⋮ Approximating Directed Weighted-Degree Constrained Networks ⋮ Optimal power consumption for demand response of thermostatically controlled loads ⋮ Seeing the trees and their branches in the network is hard ⋮ The Worst Case Finite Optimal Value in Interval Linear Programming ⋮ Faster algorithms for security games on matroids ⋮ Approximating minimum power edge-multi-covers ⋮ A generalized approximation framework for fractional network flow and packing problems ⋮ On unrooted and root-uncertain variants of several well-known phylogenetic network problems ⋮ Approximating source location and star survivable network problems ⋮ Packing edge-disjoint cycles in graphs and the cyclomatic number ⋮ Approximating survivable networks with $\beta $-metric costs ⋮ Improved approximation algorithms for maximum lifetime problems in wireless networks ⋮ Covering a laminar family by leaf to leaf links ⋮ Unnamed Item ⋮ Half-trek criterion for generic identifiability of linear structural equation models ⋮ Improved approximation algorithms for minimum power covering problems ⋮ A short proof of a min–max relation for the bases packing of a matroid ⋮ An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles ⋮ A simple algorithm for edge-coloring bipartite multigraphs ⋮ A characterization of oriented hypergraphic balance via signed weak walks ⋮ Forecasting return products in an integrated forward/reverse supply chain utilizing an ANFIS ⋮ A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius ⋮ ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS ⋮ Approximating Source Location and Star Survivable Network Problems ⋮ Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals ⋮ Digital Deformable Model Simulating Active Contours ⋮ On the representability of totally unimodular matrices on bidirected graphs ⋮ Unnamed Item ⋮ Influence diffusion in social networks under time window constraints ⋮ Influence Diffusion in Social Networks under Time Window Constraints