Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
From MaRDI portal
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
Cited in
(71)- An algorithmic proof of the Lovász local lemma via resampling oracles
- A generalized approximation framework for fractional network flow and packing problems
- Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals
- Cardinality constraints and systems of restricted representatives
- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems
- Covering a laminar family by leaf to leaf links
- Combinatorial optimization problems in wireless switch design
- ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS
- On the representability of totally unimodular matrices on bidirected graphs
- Approximating source location and star survivable network problems
- Packing edge-disjoint cycles in graphs and the cyclomatic number
- On the tree augmentation problem
- On the combinatorics of Galois numbers
- Contractors' minimum spanning tree
- Models for the single-vehicle preemptive pickup and delivery problem
- Optimal power consumption for demand response of thermostatically controlled loads
- Structural identifiability in low-rank matrix factorization
- Approximating survivable networks with \(\beta \)-metric costs
- Cardinality constrained combinatorial optimization: complexity and polyhedra
- Submodular functions: learnability, structure, and optimization
- Improved approximation algorithms for maximum lifetime problems in wireless networks
- Digital Deformable Model Simulating Active Contours
- A \((1 + \ln 2)\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
- Forecasting return products in an integrated forward/reverse supply chain utilizing an ANFIS
- Finding an optimal Nash equilibrium to the multi-agent project scheduling problem
- Small \(\ell\)-edge-covers in \(k\)-connected graphs
- Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs
- Seeing the trees and their branches in the network is hard
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The signed \(k\)-submatchings in graphs
- On sum edge-coloring of regular, bipartite and split graphs
- Influence diffusion in social networks under time window constraints
- Enhancing complex network controllability by minimum link direction reversal
- A spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphs
- Graph realizations constrained by skeleton graphs
- A short proof of a min-max relation for the bases packing of a matroid
- Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers
- A characterization of oriented hypergraphic balance via signed weak walks
- Optimal Dorfman group testing for symmetric distributions
- Envy-free pricing with general supply constraints for unit demand consumers
- Polymatroid Prophet Inequalities
- Approximating Directed Weighted-Degree Constrained Networks
- Approximating activation edge-cover and facility location problems
- Oriented hypergraphs: balanceability
- Complexity classification of the edge coloring problem for a family of graph classes
- On finite linear systems containing strict inequalities
- Influence Diffusion in Social Networks under Time Window Constraints
- Reduced-form budget allocation with multiple public alternatives
- Combing a Linkage in an Annulus
- Facet separation for disjunctive constraints with network flow representation
- Congestion games with complementarities
- Loose ear decompositions and their applications to right-angled Artin groups
- scientific article; zbMATH DE number 7561664 (Why is no real title available?)
- Submodularity and its application to some global constraints
- Random walks in polytopes and negative dependence
- Half-trek criterion for generic identifiability of linear structural equation models
- On facet-inducing inequalities for combinatorial polytopes
- Approximating directed weighted-degree constrained networks
- Efficient algorithms for maximum weight matchings in general graphs with small edge weights
- Complementary choice functions
- LP-relaxations for tree augmentation
- Improved approximation algorithms for minimum power covering problems
- Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
- Packing $k$-Matchings and $k$-Critical Graphs
- Faster algorithms for security games on matroids
- Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows
- A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
- The worst case finite optimal value in interval linear programming
- A simple algorithm for edge-coloring bipartite multigraphs
- Approximating source location and star survivable network problems
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)
