Combinatorial optimization. Theory and algorithms.
From MaRDI portal
Publication:5920350
DOI10.1007/978-3-540-71844-4zbMath1149.90126OpenAlexW4376599226WikidataQ59345513 ScholiaQ59345513MaRDI QIDQ5920350
Publication date: 25 October 2007
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-71844-4
Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Discrete location and assignment (90B80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Application of the simulated annealing local search technique to problems of redundancy elimination in functional and parametric tests of integrated circuits ⋮ Approximate Maximin Share Allocations in Matroids ⋮ Recoverable robust shortest path problems ⋮ A survey-based approach for designing the lines of a rapid transit network ⋮ On residual approximation in solution extension problems ⋮ Smoothed Analysis of the Successive Shortest Path Algorithm ⋮ Improved algorithms for joint optimization of facility locations and network connections ⋮ The Expressive Power of Binary Submodular Functions ⋮ Formal barriers to simple algorithms for the matroid secretary problem ⋮ An adaptive routing approach for personal rapid transit ⋮ Sufficient pruning conditions for MINLP in gas network design ⋮ A branch‐and‐cut algorithm for the ring spur assignment problem ⋮ On generalizations of network design problems with degree bounds ⋮ On total unimodularity of edge-edge adjacency matrices ⋮ A note on anti-coordination and social interactions ⋮ Three-matching intersection conjecture for perfect matching polytopes of small dimensions ⋮ A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints ⋮ Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties ⋮ An adaptive neurodynamic approach for solving nonsmooth \(N\)-cluster games ⋮ On fixed-parameter solvability of the minimax path location problem ⋮ New approaches to multi-objective optimization ⋮ ReLU neural networks of polynomial size for exact maximum flow computation ⋮ On the parallel complexity of constrained read-once refutations in UTVPI constraint systems ⋮ Core index of perfect matching polytope for a 2-connected cubic graph ⋮ Editing graphs to satisfy degree constraints: a parameterized approach ⋮ Graph Bipartization Problem with Applications to Via Minimization in VLSI Design ⋮ Adjacencies on random ordering polytopes and flow polytopes ⋮ Optimal hybrid fault recovery in a team of unmanned aerial vehicles ⋮ Universal Gröbner basis associated with the maximum flow problem ⋮ Convex reformulations for solving a nonlinear network design problem ⋮ The representation polyhedron of a semiorder. ⋮ Computing minimum cuts by randomized search heuristics ⋮ An analysis of the extended Christofides heuristic for the \(k\)-depot TSP ⋮ Euler Complexes ⋮ A Survey on Covering Supermodular Functions ⋮ Recent Developments in Discrete Convex Analysis ⋮ On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming ⋮ An Introduction to Network Flows over Time ⋮ Stronger instruments via integer programming in an observational study of late preterm birth outcomes ⋮ A strongly polynomial FPTAS for the symmetric quadratic knapsack problem ⋮ A comparison of lower bounds for the symmetric circulant traveling salesman problem ⋮ Nash equilibria and the price of anarchy for flows over time ⋮ On structured output training: hard cases and an efficient alternative ⋮ Housing markets through graphs ⋮ The Maximum Flow Problem for Oriented Flows ⋮ Subjectively interesting connecting trees and forests ⋮ Seeking global edges for traveling salesman problem in multi-start search ⋮ Bounds on the competence of a homogeneous jury ⋮ On the complexity of the selective graph coloring problem in some special classes of graphs ⋮ Extended formulations for order polytopes through network flows ⋮ On cardinality constrained polymatroids ⋮ On graphs with a unique perfect matching ⋮ Scheduling with job delivery coordination on single machine ⋮ The hypermetric cone and polytope on eight vertices and some generalizations ⋮ Graph editing problems with extended regularity constraints ⋮ Finding the maximal adversary structure from any given access structure ⋮ Embedding evolutionary strategy in ordinal optimization for hard optimization problems ⋮ A partition-based relaxation for Steiner trees ⋮ MuRoCo: a framework for capability- and situation-aware coalition formation in cooperative multi-robot systems ⋮ Maximization of the Choquet integral over a convex set and its application to resource allocation problems ⋮ Generalised \(k\)-Steiner tree problems in normed planes ⋮ Valid inequalities for the topology optimization problem in gas network design ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Privatized rural postman problems ⋮ An algorithmic study of switch graphs ⋮ The Floyd-Warshall algorithm on graphs with negative cycles ⋮ Affinity and fluctuations in a mesoscopic noria ⋮ Modelling convex shape priors and matching based on the Gromov-Wasserstein distance ⋮ Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty ⋮ A faster polynomial algorithm for the unbalanced Hitchcock transportation problem ⋮ Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem ⋮ Algorithms for the metric ring star problem with fixed edge-cost ratio ⋮ A simple algorithm for multicuts in planar graphs with outer terminals ⋮ Refined cut selection for Benders decomposition: applied to network capacity expansion problems ⋮ A note on the single machine scheduling to minimize the number of tardy jobs with deadlines ⋮ Breaking thermaxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem ⋮ Matching polytopes and Specht modules ⋮ \(1\)-line minimum rectilinear Steiner trees and related problems ⋮ Virtual private network design over the first Chvátal closure ⋮ Equilibria in load balancing games ⋮ A moving horizon approach to a noncontinuum state estimation ⋮ The \(k\)-separator problem: polyhedra, complexity and approximation results ⋮ Fast algorithms for the undirected negative cost cycle detection problem
