Combinatorial optimization. Theory and algorithms.

From MaRDI portal
Publication:5915481


zbMath1002.90046MaRDI QIDQ5915481

Bernhard Korte, Jens Vygen

Publication date: 23 May 2002

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


90C27: Combinatorial optimization

90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming

90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming


Related Items

Restricted b‐factors in bipartite graphs and t‐designs, GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance, Computing pure Nash and strong equilibria in bottleneck congestion games, Altruistically unbalanced kidney exchange, Packing cycles exactly in polynomial time, Bounding the payment of approximate truthful mechanisms, Enumeration of all wedged equilibrium configurations in contact problem with Coulomb friction, Approximation results for a min-max location-routing problem, Pairwise kidney exchange, Greedy-type resistance of combinatorial problems, Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan, The travelling preacher, projection, and a lower bound for the stability number of a graph, Computing \(c\)-optimal experimental designs using the simplex method of linear programming, A novel iterative shape from focus algorithm based on combinatorial optimization, A minimization version of a directed subgraph homeomorphism problem, On the approximability of the maximum agreement subtree and maximum compatible tree problems, Persistency and matroid intersection, Approximation algorithms for orthogonal packing problems for hypercubes, A new greedy algorithm for the quadratic assignment problem, Informative path planning as a maximum traveling salesman problem with submodular rewards, Least and most colored bases, Graph kernels and Gaussian processes for relational reinforcement learning, Bike sharing systems: solving the static rebalancing problem, Heuristic for a new multiobjective scheduling problem, Parsimonious reduction of Gaussian mixture models with a variational-Bayes approach, A Protocol for Cutting Matroids Like Cakes, Approximation results for min-max path cover problems in vehicle routing, Online traveling salesman problems with service flexibility, Real-Time Optimal Time-Critical Target Assignment for UAVs, Online Vehicle Routing Problems: A Survey