Combinatorial optimization. Theory and algorithms.
From MaRDI portal
Publication:5915481
zbMath1002.90046MaRDI QIDQ5915481
Publication date: 23 May 2002
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Packing a Knapsack of Unknown Capacity ⋮ On computing the Galois lattice of bipartite distance hereditary graphs ⋮ A fast algorithm for the rectilinear distance location problem ⋮ On maximin share allocations in matroids ⋮ An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem ⋮ Least and most colored bases ⋮ GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance ⋮ Greedy-type resistance of combinatorial problems ⋮ Efficient identification of link importance in dynamic networks ⋮ Parsimonious reduction of Gaussian mixture models with a variational-Bayes approach ⋮ Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope ⋮ The skiving stock problem and its relation to hypergraph matchings ⋮ A Protocol for Cutting Matroids Like Cakes ⋮ Computing pure Nash and strong equilibria in bottleneck congestion games ⋮ The optimal solution set of the multi-source Weber problem ⋮ Additive stabilizers for unstable graphs ⋮ Altruistically unbalanced kidney exchange ⋮ A new greedy algorithm for the quadratic assignment problem ⋮ Packing cycles exactly in polynomial time ⋮ Graph kernels and Gaussian processes for relational reinforcement learning ⋮ Enumeration of all wedged equilibrium configurations in contact problem with Coulomb friction ⋮ Bike sharing systems: solving the static rebalancing problem ⋮ Bounding the payment of approximate truthful mechanisms ⋮ Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan ⋮ Heuristic for a new multiobjective scheduling problem ⋮ Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros ⋮ Properties of combinatorial optimization problems over polyhedral-spherical sets ⋮ The travelling preacher, projection, and a lower bound for the stability number of a graph ⋮ Real-Time Optimal Time-Critical Target Assignment for UAVs ⋮ Online Vehicle Routing Problems: A Survey ⋮ Primal and dual predicted decrease approximation methods ⋮ Computing \(c\)-optimal experimental designs using the simplex method of linear programming ⋮ Maximum flows in generalized processing networks ⋮ A novel iterative shape from focus algorithm based on combinatorial optimization ⋮ Optimal matroid partitioning problems ⋮ Approximation results for min-max path cover problems in vehicle routing ⋮ A minimization version of a directed subgraph homeomorphism problem ⋮ Restricted b‐factors in bipartite graphs and t‐designs ⋮ Outer linear measure of connected sets via Steiner trees ⋮ On the approximability of the maximum agreement subtree and maximum compatible tree problems ⋮ Online traveling salesman problems with service flexibility ⋮ Approximation results for a min-max location-routing problem ⋮ Efficient approximation algorithms for maximum coverage with group budget constraints ⋮ Unnamed Item ⋮ Persistency and matroid intersection ⋮ Approximation algorithms for orthogonal packing problems for hypercubes ⋮ Mode Detection and Fault Diagnosis in Hybrid Systems ⋮ Exact algorithms for finding constrained minimum spanning trees ⋮ Unnamed Item ⋮ Informative path planning as a maximum traveling salesman problem with submodular rewards ⋮ Pairwise kidney exchange
