Combinatorial optimization. Theory and algorithms
From MaRDI portal
Publication:5915844
DOI10.1007/978-3-662-56039-6zbMath1390.90001OpenAlexW4293179730MaRDI 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
Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items (62)
Randomized shortest paths with net flows and capacity constraints ⋮ Minimum cuts in geometric intersection graphs ⋮ Approximation algorithms for the \(k\)-depots Hamiltonian path problem ⋮ Swapping Colored Tokens on Graphs ⋮ The dynamic team forming problem: throughput and delay for unbiased policies ⋮ Matroid bases with cardinality constraints on the intersection ⋮ On computational capabilities of Ising machines based on nonlinear oscillators ⋮ Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix ⋮ An approximation algorithm for solving the heterogeneous Chinese postman problem ⋮ Two dimensional maximum weight matching using Manhattan topology ⋮ Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost ⋮ Data Reduction for Maximum Matching on Real-World Graphs ⋮ Matheuristics: survey and synthesis ⋮ A practitioner’s guide to quantum algorithms for optimisation problems ⋮ On matchings, T‐joins, and arc routing in road networks ⋮ Combinatorial acyclicity models for potential‐based flows ⋮ Min‐sum controllable risk problems with concave risk functions of the same value range ⋮ Optimal sufficient requirements on the embedded Ising problem in polynomial time ⋮ Strategyproof mechanism for two-sided matching with resource allocation ⋮ Single machine scheduling with rejection to minimize the \(k\)-th power of the makespan ⋮ Finding optimal non-datapath caching strategies via network flow ⋮ Coarse-grid selection using simulated annealing ⋮ A survey on exact algorithms for the maximum flow and minimum‐cost flow problems ⋮ Approximation algorithms for multi-vehicle stacker crane problems ⋮ Scheduling with machine conflicts ⋮ Improving a constructive heuristic for the general routing problem ⋮ Linear-size formulations for connected planar graph partitioning and political districting ⋮ Approximation algorithms for the restricted \(k\)-Chinese postman problems with penalties ⋮ On the socle of Artinian algebras associated with graphs ⋮ Minor embedding in broken chimera and derived graphs is NP-complete ⋮ Approval-based apportionment ⋮ Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover ⋮ Attack and defense in the layered cyber-security model and their \((1 \pm \varepsilon)\)-approximation schemes ⋮ Unnamed Item ⋮ On a weighted linear matroid intersection algorithm by deg-det computation ⋮ Local search with a SAT oracle for combinatorial optimization ⋮ Chain Rule Optimal Transport ⋮ Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments ⋮ Optimization Methods: An Applications-Oriented Primer ⋮ Approximation algorithms for some min-max postmen cover problems ⋮ Extended random assignment mechanisms on a family of good sets ⋮ Trouble comes in threes: core stability in minimum cost connection networks ⋮ The Multiplex Decomposition: An Analytic Framework for Multilayer Dynamical Networks ⋮ Facets of the dynamic monopoly polytope: linear ordering formulation ⋮ Approximation algorithms for some min-max and minimum stacker crane cover problems ⋮ A two-step method for solving vector optimization problems on permutation configuration ⋮ Approximation algorithms for some minimum postmen cover problems ⋮ A new contraction technique with applications to congruency-constrained cuts ⋮ The linkedness of cubical polytopes: the cube ⋮ Learning Control Sets for Lattice Planners from User Preferences ⋮ 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 ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ A dichotomy result for cyclic-order traversing games ⋮ Feasibility criteria for high-multiplicity partitioning problems ⋮ Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings ⋮ The maximum 1-2 matching problem and two kinds of its variants ⋮ General restricted inverse assignment problems under \(l_1\) and \(l_{\infty}\) norms ⋮ Some conditions for the existence of Euler \(H\)-trails ⋮ Reducing Path TSP to TSP ⋮ Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization ⋮ An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
This page was built for publication: Combinatorial optimization. Theory and algorithms
