Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matroids and geometric lattices (05B35) Hypergraphs (05C65) Computational aspects related to convexity (52B55) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Schrijver's monography of combinatorial optimization is now available on a CD-ROM which autostarts on a Windows PC or an Apple Macintosh by using Acrobat Reader. The CD contains exactly the full text of all three volumes, but no hyperlinks. For a review of Schrijver's book see Zbl 1041.90001.
Recommendations
Cited in
(78)- A simple algorithm for edge-coloring bipartite multigraphs
- On the representability of totally unimodular matrices on bidirected graphs
- Half-trek criterion for generic identifiability of linear structural equation models
- Complexity classification of the edge coloring problem for a family of graph classes
- LP-relaxations for tree augmentation
- Finding an optimal Nash equilibrium to the multi-agent project scheduling problem
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Oriented hypergraphs: balanceability
- Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers
- Approximating activation edge-cover and facility location problems
- Reduced-form budget allocation with multiple public alternatives
- Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals
- Influence diffusion in social networks under time window constraints
- Graph realizations constrained by skeleton graphs
- Submodularity and its application to some global constraints
- On finite linear systems containing strict inequalities
- Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
- Small \(\ell\)-edge-covers in \(k\)-connected graphs
- On sum edge-coloring of regular, bipartite and split graphs
- Envy-free pricing with general supply constraints for unit demand consumers
- The signed \(k\)-submatchings in graphs
- On the tree augmentation problem
- Cardinality constraints and systems of restricted representatives
- Approximating source location and star survivable network problems
- Influence Diffusion in Social Networks under Time Window Constraints
- A (1 + 2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
- Enhancing complex network controllability by minimum link direction reversal
- Polymatroid Prophet Inequalities
- Approximating Directed Weighted-Degree Constrained Networks
- ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS
- Digital Deformable Model Simulating Active Contours
- A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
- Models for the single-vehicle preemptive pickup and delivery problem
- Cardinality constrained combinatorial optimization: complexity and polyhedra
- Submodular functions: learnability, structure, and optimization
- Packing $k$-Matchings and $k$-Critical Graphs
- Optimal power consumption for demand response of thermostatically controlled loads
- Random walks in polytopes and negative dependence
- An algorithmic proof of the Lovász local lemma via resampling oracles
- Approximating activation edge-cover and facility location problems
- The worst case finite optimal value in interval linear programming
- Contractors' minimum spanning tree
- A short proof of a min-max relation for the bases packing of a matroid
- Congestion games with complementarities
- Approximating source location and star survivable network problems
- On facet-inducing inequalities for combinatorial polytopes
- Approximating survivable networks with \(\beta \)-metric costs
- Efficient algorithms for maximum weight matchings in general graphs with small edge weights
- A spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphs
- Improved approximation algorithms for minimum power covering problems
- Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs
- Combing a Linkage in an Annulus
- On the combinatorics of Galois numbers
- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs
- Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows
- Approximating directed weighted-degree constrained networks
- Optimal Dorfman group testing for symmetric distributions
- Facet separation for disjunctive constraints with network flow representation
- Loose ear decompositions and their applications to right-angled Artin groups
- Complementary choice functions
- Faster algorithms for security games on matroids
- A generalized approximation framework for fractional network flow and packing problems
- Circle squaring with pieces of small boundary and low Borel complexity
- Efficient certifying algorithms for linear classification
- On the constrained Steiner strong connectivity augmentation problem
- Improved approximation algorithms for maximum lifetime problems in wireless networks
- A logarithmic approximation algorithm for the activation edge-multicover problem
- On the windy k-traveling salesman problem
- The facets of the subtour polytope
- Maximum list r-colorable induced subgraphs in kp₃-free graphs
- A characterization of oriented hypergraphic balance via signed weak walks
- Forecasting return products in an integrated forward/reverse supply chain utilizing an ANFIS
- Structural identifiability in low-rank matrix factorization
- Combinatorial optimization problems in wireless switch design
- Seeing the trees and their branches in the network is hard
- Packing edge-disjoint cycles in graphs and the cyclomatic number
- Covering a laminar family by leaf to leaf links
This page was built for publication: Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1883342)
