Handbook of combinatorial optimization. In 5 volumes
From MaRDI portal
Publication:4904874
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)
Recommendations
Cited in
(32)- Allocating resources via price management systems: a dynamic programming-based approach
- 2-edge connected dominating sets and 2-connected dominating sets of a graph
- Modelling and solving resource allocation problems via a dynamic programming approach
- A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization
- A two-step method for solving vector optimization problems on permutation configuration
- Research trends in combinatorial optimization
- Sensitivity analysis of combinatorial optimization problems using evolutionary bilevel optimization and data mining
- Tabu search for the cyclic bandwidth problem
- Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach
- Two-dimensional knapsack-block packing problem
- scientific article; zbMATH DE number 1297591 (Why is no real title available?)
- scientific article; zbMATH DE number 1384868 (Why is no real title available?)
- Solutions of the combinatorial problem with a quadratic fractional objective function on the set of permutations
- Applications of combinatorial optimization
- The maximum feasible subset problem (maxFS) and applications
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices
- Algorithmic mechanism design with investment
- An interactive approach for solving the multiobjective minimum cost flow problem in the fuzzy environment
- Encyclopedia of Optimization
- Comparison of metaheuristics for the \(k\)-labeled spanning forest problem
- 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
- A local algorithm and its percolation analysis of bipartite z-matching problem
- Equitable neighbour-sum-distinguishing edge and total colourings
- scientific article; zbMATH DE number 1198942 (Why is no real title available?)
- Minimum non-submodular cover problem with applications
- A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems
- Two faces of greedy leaf removal procedure on graphs
- Equitable colorings of Cartesian products with balanced complete multipartite graphs
- Edge searching and fast searching with constraints
- Fair integral submodular flows
- Properties of combinatorial optimization problems over polyhedral-spherical sets
This page was built for publication: Handbook of combinatorial optimization. In 5 volumes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4904874)
