Combinatorial optimization. Theory and algorithms.
From MaRDI portal
Publication:5894455
DOI10.1007/978-3-642-24488-9zbMath1237.90001OpenAlexW4292027170MaRDI 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
Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Matching One Sample According to Two Criteria in Observational Studies, Reconfiguration of spanning trees with degree constraints or diameter constraints, Reverse stress testing: Scenario design for macroprudential stress tests, A robust optimization model for affine/quadratic flow thinning: A traffic protection mechanism for networks with variable link capacity, Scheduling with day shifts and breaks, The Polyhedral Geometry of Pivot Rules and Monotone Paths, Popular Matchings with Ties and Matroid Constraints, Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties, The risk of maternal complications after Cesarean delivery: near-far matching for instrumental variables study designs with large observational datasets, Automated repair for timed systems, Latency vs precision: stability preserving perception scheduling, Many nodal domains in random regular graphs, Continuous Relaxation for Discrete DC Programming, Unified Greedy Approximability beyond Submodular Maximization, A 2-phase approach for planning of hazardous waste collection using an unmanned aerial vehicle, Unnamed Item, Unified greedy approximability beyond submodular maximization, Organization of the control subsystem in real-time computing systems, Robust transshipment problem under consistent flow constraints, Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints, 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, Some graph optimization problems with weights satisfying linear constraints, Cycle-connected mixed graphs and related problems, Cycle-connected mixed graphs and related problems, Delay-constrained minimum shortest path trees and related problems, Delay-constrained minimum shortest path trees and related problems, Randomization Helps Computing a Minimum Spanning Tree under Uncertainty, A primitive-based 3D segmentation algorithm for mechanical CAD models, Algorithm NextFit for the bin packing problem, Interpreting the basis path set in neural networks, Simplified group activity selection with group size constraints, Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times, Multiple cost coefficients sensitivity theorems of integer linear optimization, Knapsack polytopes: a survey, Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation, Popular Branchings and Their Dual Certificates, Notes on \(\{a,b,c\}\)-modular matrices, Bin packing with divisible item sizes and rejection penalties, How to minimize cycle times of robot manufacturing systems, Randomization Helps Computing a Minimum Spanning Tree under Uncertainty, Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms, Steiner Trees with Bounded RC-Delay, Graded Matching for Large Observational Studies, Inverse portfolio problem with coherent risk measures, Scheduling under linear constraints, Efficient algorithms for scheduling parallel jobs with interval constraints in clouds, Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths, The Linear Complementarity Problems with a Few Variables per Constraint, Exploiting complete linear descriptions for decentralized power market problems with integralities, Evolutionary operators for the Hamiltonian completion problem, Revealed preference test and shortest path problem; graph theoretic structure of the rationalizability test, Connectivity of orientations of 3-edge-connected graphs, When Do Gomory--Hu Subtrees Exist?, Minimum-cost flow algorithms: an experimental evaluation, Reinforcement learning for combinatorial optimization: a survey, Bin packing under linear constraints, A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems, Flexible flow shop with dedicated buffers, Removing algorithmic discrimination (with minimal individual error), Approximating connected safe sets in weighted trees, Robust minimum cost flow problem under consistent flow constraints, A weighted perfect matching with constraints on weights of its parts, Optimal deployment of virtual network functions for securing telecommunication networks against distributed denial of service attacks: a robust optimization approach, Reconfiguration of maximum-weight \(b\)-matchings in a graph, The parity Hamiltonian cycle problem, Large rainbow matchings in general graphs, Strategyproof allocation mechanisms with endowments and M-convex distributional constraints, Sparse recovery with integrality constraints, The \(b\)-branching problem in digraphs, Total Dual Integrality of Triangle Covering, Agreeable sets with matroidal constraints, Combinatorial optimization through variational quantum power method, Binary optimal control by trust-region steepest descent, Unnamed Item, ARRIVAL: A Zero-Player Graph Game in NP ∩ coNP, Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem, Fractional perfect \(b\)-matching polytopes. I: General theory, 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, 2-stage robust MILP with continuous recourse variables, Complete description for the spanning tree problem with one linearised quadratic term, Robustifying sum-product networks, An interactive approach for solving the multiobjective minimum cost flow problem in the fuzzy environment, 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, Incremental space-filling design based on coverings and spacings: improving upon low discrepancy sequences, Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art, 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, Steiner trees with bounded RC-delay, Designing matching mechanisms under constraints: an approach from discrete convex analysis, Flow-firing processes, Surrogate optimization for \(p\)-norms, Checking inference-proofness of attribute-disjoint and duplicate-preserving fragmentations, Using Approximation Algorithms to Build Evidence Factors and Related Designs for Observational Studies, Unnamed Item, Lack of fit tests for linear regression models with many predictor variables using minimal weighted maximal matchings, Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking, Combinatorial optimization algorithms for detecting collapse mechanisms of concrete slabs, Dynamic Atomic Congestion Games with Seasonal Flows, On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows, A separation algorithm for the simple plant location problem, Margin of victory for tournament solutions, Trustworthy Graph Algorithms (Invited Talk), Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas, Secretary problem: graphs, matroids and greedoids, The Parity Hamiltonian Cycle Problem in Directed Graphs, Computing in combinatorial optimization, Multiscale change-point segmentation: beyond step functions, On a single machine-scheduling problem with separated position and resource effects, Recomputing causality assignments on lumped process models when adding new simplification assumptions, Integer plane multiflow maximisation: one-quarter-approximation and gaps, Approximation algorithms for solving the line-capacitated minimum Steiner tree problem, Robust inventory problem with budgeted cumulative demand uncertainty, Method of Alternating Contractions and Its Applications to Some Convex Optimization Problems, Approximation algorithms for solving the heterogeneous Chinese postman problem, Constructing the basis path set by eliminating the path dependency, Popular branchings and their dual certificates
