Combinatorial optimization. Theory and algorithms
From MaRDI portal
Publication:5915386
zbMath0953.90052MaRDI QIDQ5915386
Publication date: 30 July 2000
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems
90C59: Approximation methods and heuristics in mathematical programming
90B10: Deterministic network models in operations research
90C27: Combinatorial optimization
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs, Unnamed Item, Heuristic algorithms for visiting the customers in a rolling schedule environment, Approximability of single machine scheduling with fixed jobs to minimize total completion time, An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms, Algorithms for long paths in graphs, Rees algebras and polyhedral cones of ideals of vertex covers of perfect graphs, Combinatorial optimization problems in wireless switch design, Pruning in column generation for service vehicle dispatching, Local edge-connectivity augmentation in hypergraphs is NP-complete, Algorithm for two disjoint long paths in 2-connected graphs, A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph, Submodular function minimization, Substitute goods, auctions, and equilibrium, Blowup algebras of square-free monomial ideals and some links to combinatorial optimization problems, Cycle-based facets of chromatic scheduling polytopes, A detachment algorithm for inferring a graph from path frequency, Geometric quadrisection in linear time, with application to VLSI placement, Laminar structure of ptolemaic graphs with applications, Two-stage flexible-choice problems under uncertainty, Canonical modules of certain edge subrings, Greedy splitting algorithms for approximating multiway partition problems, Traveling salesman games with the Monge property, Constructive heuristics for the canister filling problem, On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection, The complexity of maximum matroid--greedoid intersection and weighted greedoid maximiza\-tion, Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs, On the complexity of the planar directed edge-disjoint paths problem, Gradient-based nonlinear microstructure design, Line planning, path constrained network flow and inapproximability, Nonlinear Optimization for the Recognition of Discrete Linear Objects, Normalization of monomial ideals and Hilbert functions
