Combinatorial optimization. Theory and algorithms.
From MaRDI portal
Publication:5894455
DOI10.1007/978-3-642-24488-9zbMath1237.90001MaRDI QIDQ5894455
Publication date: 2 January 2012
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24488-9
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
ARRIVAL: A Zero-Player Graph Game in NP ∩ coNP, Unnamed Item, Dynamic Atomic Congestion Games with Seasonal Flows, On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows, Randomization Helps Computing a Minimum Spanning Tree under Uncertainty, On a single machine-scheduling problem with separated position and resource effects, Popular Matchings with Ties and Matroid Constraints, Continuous Relaxation for Discrete DC Programming, Augmenting trail theorem for the maximum 1-2 matching problem, On the Inequalities of Projected Volumes and the Constructible Region, The Secret Life of Keys: On the Calculation of Mechanical Lock Systems, A classification of slow convergence near parametric periodic points of discrete dynamical systems, Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity, Inverse portfolio problem with coherent risk measures, Scheduling under linear constraints, Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths, Revealed preference test and shortest path problem; graph theoretic structure of the rationalizability test, Steiner trees with bounded RC-delay, Lack of fit tests for linear regression models with many predictor variables using minimal weighted maximal matchings, Knapsack polytopes: a survey, Bin packing under linear constraints, The parity Hamiltonian cycle problem, Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem, Robustifying sum-product networks, Antimatroids induced by matchings, Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks, A dynamic programming approach for the pipe network layout problem, The decomposition problem for the set of paths in a directed graph and its application, The matroid structure of representative triple sets and triple-closure computation, Two new reformulation convexification based hierarchies for 0-1 MIPs, New valid inequalities and facets for the simple plant location problem, On maximizing a monotone \(k\)-submodular function subject to a matroid constraint, Simple cubic graphs with no short traveling salesman tour, Investigation on irreducible cost vectors in minimum cost arborescence problems, Designing matching mechanisms under constraints: an approach from discrete convex analysis, Flow-firing processes, Surrogate optimization for \(p\)-norms, Approximating connected safe sets in weighted trees, Sparse recovery with integrality constraints, The \(b\)-branching problem in digraphs, A method to solve conditional optimization problems with quadratic objective functions on the set of permutations, Theory and methods of Euclidian combinatorial optimization: current status and prospects, Solutions of the combinatorial problem with a quadratic fractional objective function on the set of permutations, Matching methods for observational studies derived from large administrative databases, Rejoinder: Matching methods for observational studies derived from large administrative databases, An interactive approach for solving the multiobjective minimum cost flow problem in the fuzzy environment, Checking inference-proofness of attribute-disjoint and duplicate-preserving fragmentations, Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas, Multiscale change-point segmentation: beyond step functions, Recomputing causality assignments on lumped process models when adding new simplification assumptions, A primitive-based 3D segmentation algorithm for mechanical CAD models, A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems, Flexible flow shop with dedicated buffers, Reconfiguration of maximum-weight \(b\)-matchings in a graph, Large rainbow matchings in general graphs, Agreeable sets with matroidal constraints, Fractional perfect \(b\)-matching polytopes. I: General theory, 2-stage robust MILP with continuous recourse variables, Complete description for the spanning tree problem with one linearised quadratic term, Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms, Connectivity of orientations of 3-edge-connected graphs, The Parity Hamiltonian Cycle Problem in Directed Graphs, Minimum-cost flow algorithms: an experimental evaluation, Total Dual Integrality of Triangle Covering, Randomization Helps Computing a Minimum Spanning Tree under Uncertainty, Steiner Trees with Bounded RC-Delay, The Linear Complementarity Problems with a Few Variables per Constraint
