Combinatorial optimization. Theory and algorithms

Publication date: 30 July 2000

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

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (55)

Maximum and optimal 1-2 matching problem of the different kind ⋮ On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\) ⋮ 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 ⋮ Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs ⋮ Co-density and fractional edge cover packing ⋮ Algorithms for long paths in graphs ⋮ Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries ⋮ Branch and cut algorithms for detecting critical nodes in undirected graphs ⋮ Complexity of (arc)-connectivity problems involving arc-reversals or deorientations ⋮ Canonical modules of certain edge subrings ⋮ Normalization of monomial ideals and Hilbert functions ⋮ Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications ⋮ Multiflow Feasibility: An Annotated Tableau ⋮ Production scheduling with alternative process plans ⋮ COMPUTATIONAL METHODS FOR LOGISTICS PROBLEMS RELATED TO OPTIMAL TREES ⋮ NETWORK DESIGN FOR MINIMUM SPANNING TREES UNDER HAMMING DISTANCE ⋮ Ground states of two-dimensional Ising spin glasses: fast algorithms, recent developments and a ferromagnet-spin glass mixture ⋮ Performance-oriented communication topology design for distributed control of interconnected systems ⋮ How many attackers can selfish defenders catch? ⋮ 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 ⋮ Identification of unidentified equality constraints for integer programming problems ⋮ Solving travelling salesman problem using ant systems: a programmer's approach ⋮ Local edge-connectivity augmentation in hypergraphs is NP-complete ⋮ 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 ⋮ Greedy splitting algorithms for approximating multiway partition problems ⋮ Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs ⋮ Algorithm for two disjoint long paths in 2-connected graphs ⋮ Constructive heuristics for the canister filling problem ⋮ 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 ⋮ On single machine scheduling with resource constraint ⋮ Substitute goods, auctions, and equilibrium ⋮ The uniqueness property for networks with several origin-destination pairs ⋮ Line planning, path constrained network flow and inapproximability ⋮ Strong mixed-integer programming formulations for trained neural networks ⋮ 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 ⋮ Improving efficiency in school choice under partial priorities ⋮ Geometric quadrisection in linear time, with application to VLSI placement ⋮ Laminar structure of ptolemaic graphs with applications ⋮ Unnamed Item ⋮ Traveling salesman games with the Monge property ⋮ Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models ⋮ Two-stage flexible-choice problems under uncertainty ⋮ Complexity of some arc-partition problems for digraphs ⋮ Quasi-Transitive Digraphs and Their Extensions ⋮ On the complexity of the planar directed edge-disjoint paths problem ⋮ Gradient-based nonlinear microstructure design ⋮ Nonlinear Optimization for the Recognition of Discrete Linear Objects

This page was built for publication: Combinatorial optimization. Theory and algorithms