Combinatorial optimization. Theory and applications.
From MaRDI portal
Publication:2574644
DOI10.1007/3-540-29297-7zbMath1099.90054OpenAlexW4210279210MaRDI 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
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
Eulerian ideals ⋮ Approximation algorithms for simple assembly line balancing problems ⋮ Distribution of a heterogeneous set of resources in multiprocessor scheduling ⋮ Arborescences of covering graphs ⋮ Evolutionary algorithms and matroid optimization problems ⋮ Matroid representation of clique complexes ⋮ Satisfying more than half of a system of linear equations over GF(2): a multivariate approach ⋮ Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm ⋮ Nowhere-zero unoriented 6-flows on certain triangular graphs ⋮ A branch-and-bound algorithm for the acyclic partitioning problem ⋮ Recoverable robust representatives selection problems with discrete budgeted uncertainty ⋮ Optimization of the structure of a real-time multiprocessor system ⋮ Complexity of constrained sensor placement problems for optimal observability ⋮ Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning ⋮ Solution Enumeration by Optimality in Answer Set Programming ⋮ Lower and upper bounding procedures for the bin packing problem with concave loading cost ⋮ Reachability in Simple Neural Networks ⋮ On the probabilistic min spanning tree problem ⋮ Technical Note—Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources ⋮ Lightweight paths in graphs ⋮ Analytical Problem Solving Based on Causal, Correlational and Deductive Models ⋮ Оптимизация загрузки упорядоченной совокупности летательных аппаратов ⋮ Average behavior of greedy algorithms for the minimization knapsack problem: General coefficient distributions ⋮ A Ramsey bound on stable sets in Jordan pillage games ⋮ On facet-inducing inequalities for combinatorial polytopes ⋮ An improved approximation algorithm for the clustered traveling salesman problem ⋮ Tree metrics and edge-disjoint \(S\)-paths ⋮ Nowhere-zero 15-flow in 3-edge-connected bidirected graphs ⋮ Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem ⋮ A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures ⋮ Task assignment algorithms for two-type heterogeneous multiprocessors ⋮ Sufficient conditions for uniform bounds in abstract polymer systems and explorative partition schemes ⋮ Minimizing the total weighted completion time in the relocation problem ⋮ Flows in 3-edge-connected bidirected graphs ⋮ Approximating optimum branchings in linear time ⋮ Parallel algorithms for bipartite matching problems on distributed memory computers ⋮ Scheduling in multiprocessor systems with additional restrictions ⋮ Optimizing compatible sets in wireless networks through integer programming ⋮ Robust Independence Systems ⋮ Theoretical and computational advances for network diversion ⋮ Power Indices in Spanning Connectivity Games ⋮ FPT-algorithm for computing the width of a simplex given by a convex hull ⋮ Zero-sum 6-flows in 5-regular graphs ⋮ Wavelet BEM on molecular surfaces: parametrization and implementation ⋮ New formulations and solutions for the strategic berth template problem ⋮ Rees algebras of filtrations of covering polyhedra and integral closure of powers of monomial ideals ⋮ Degree and regularity of Eulerian ideals of hypergraphs ⋮ Improved approximation algorithms for constrained fault-tolerant resource allocation ⋮ A duality theorem for the ic-resurgence of edge ideals
This page was built for publication: Combinatorial optimization. Theory and applications.
