Combinatorial optimization. Theory and algorithms
From MaRDI portal
Publication:5915844
DOI10.1007/978-3-662-56039-6zbMath1390.90001MaRDI QIDQ5915844
Publication date: 9 January 2018
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-56039-6
90C27: Combinatorial optimization
90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming
Related Items
A Tractable Class of Binary VCSPs via M-Convex Intersection, A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage, Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings, The maximum 1-2 matching problem and two kinds of its variants, A new contraction technique with applications to congruency-constrained cuts, Minimum cuts in geometric intersection graphs, The dynamic team forming problem: throughput and delay for unbiased policies, Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix, Attack and defense in the layered cyber-security model and their \((1 \pm \varepsilon)\)-approximation schemes, On a weighted linear matroid intersection algorithm by deg-det computation, A review of four decades of time-dependent scheduling: main results, new topics, and open problems, Some conditions for the existence of Euler \(H\)-trails, Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization, Swapping Colored Tokens on Graphs
