Combinatorial optimization. Theory and applications.
From MaRDI portal
Publication:2574644
DOI10.1007/3-540-29297-7zbMath1099.90054MaRDI QIDQ2574644
Publication date: 29 November 2005
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-29297-7
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
Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm, Lightweight paths in graphs, Оптимизация загрузки упорядоченной совокупности летательных аппаратов, On facet-inducing inequalities for combinatorial polytopes, Robust Independence Systems, A branch-and-bound algorithm for the acyclic partitioning problem, An improved approximation algorithm for the clustered traveling salesman problem, Tree metrics and edge-disjoint \(S\)-paths, A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures, Flows in 3-edge-connected bidirected graphs, A Ramsey bound on stable sets in Jordan pillage games, Parallel algorithms for bipartite matching problems on distributed memory computers, Evolutionary algorithms and matroid optimization problems, Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem, Minimizing the total weighted completion time in the relocation problem, Approximating optimum branchings in linear time, Wavelet BEM on molecular surfaces: parametrization and implementation, Scheduling in multiprocessor systems with additional restrictions, On the probabilistic min spanning tree problem, Task assignment algorithms for two-type heterogeneous multiprocessors, Sufficient conditions for uniform bounds in abstract polymer systems and explorative partition schemes, FPT-algorithm for computing the width of a simplex given by a convex hull, Zero-sum 6-flows in 5-regular graphs, Improved approximation algorithms for constrained fault-tolerant resource allocation, Matroid representation of clique complexes, Nowhere-zero 15-flow in 3-edge-connected bidirected graphs, Optimizing compatible sets in wireless networks through integer programming, Satisfying more than half of a system of linear equations over GF(2): a multivariate approach, Theoretical and computational advances for network diversion, Power Indices in Spanning Connectivity Games
