Handbook of Combinatorial Optimization

DOI10.1007/978-1-4419-7997-1zbMath1496.90001OpenAlexW4210500228MaRDI QIDQ4904874

No author found.

Publication date: 13 February 2013

Full work available at URL: https://doi.org/10.1007/978-1-4419-7997-1

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00)

Related Items (26)

A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems ⋮ Comparison of metaheuristics for the k‐labeled spanning forest problem ⋮ The maximum feasible subset problem (maxFS) and applications ⋮ Tabu search for the cyclic bandwidth problem ⋮ Fair integral submodular flows ⋮ A local algorithm and its percolation analysis of bipartite z-matching problem ⋮ Research trends in combinatorial optimization ⋮ Sensitivity analysis of combinatorial optimization problems using evolutionary bilevel optimization and data mining ⋮ Edge searching and fast searching with constraints ⋮ 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 ⋮ Two faces of greedy leaf removal procedure on graphs ⋮ Equitable colorings of Cartesian products with balanced complete multipartite graphs ⋮ An interactive approach for solving the multiobjective minimum cost flow problem in the fuzzy environment ⋮ Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach ⋮ Two-dimensional knapsack-block packing problem ⋮ Properties of combinatorial optimization problems over polyhedral-spherical sets ⋮ Modelling and solving resource allocation problems via a dynamic programming approach ⋮ Minimum non-submodular cover problem with applications ⋮ Equitable neighbour-sum-distinguishing edge and total colourings ⋮ 2-edge connected dominating sets and 2-connected dominating sets of a graph ⋮ A two-step method for solving vector optimization problems on permutation configuration ⋮ A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization ⋮ $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices ⋮ Allocating resources via price management systems: a dynamic programming-based approach

This page was built for publication: Handbook of Combinatorial Optimization