Handbook of combinatorial optimization. In 5 volumes
From MaRDI portal
Publication:4904874
Collections of articles of miscellaneous specific interest (00B15) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Combinatorial optimization (90C27)
Recommendations
Cited in
(42)- Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach
- Properties of combinatorial optimization problems over polyhedral-spherical sets
- Equitable neighbour-sum-distinguishing edge and total colourings
- Two-dimensional knapsack-block packing problem
- A two-step method for solving vector optimization problems on permutation configuration
- Fair integral submodular flows
- 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
- An interactive approach for solving the multiobjective minimum cost flow problem in the fuzzy environment
- Minimum non-submodular cover problem with applications
- A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization
- A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems
- L_p-norm regularization algorithms for optimization over permutation matrices
- Tabu search for the cyclic bandwidth problem
- Encyclopedia of Optimization
- scientific article; zbMATH DE number 1198942 (Why is no real title available?)
- scientific article; zbMATH DE number 1297591 (Why is no real title available?)
- scientific article; zbMATH DE number 1384868 (Why is no real title available?)
- Equitable colorings of Cartesian products with balanced complete multipartite graphs
- Allocating resources via price management systems: a dynamic programming-based approach
- Two faces of greedy leaf removal procedure on graphs
- Modelling and solving resource allocation problems via a dynamic programming approach
- Comparison of metaheuristics for the k-labeled spanning forest problem
- Applications of combinatorial optimization
- The maximum feasible subset problem (maxFS) and applications
- 2-edge connected dominating sets and 2-connected dominating sets of a graph
- 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
- Algorithmic mechanism design with investment
- Non-convex optimization problems with linear KKT subsystem
- Equitable and list equitable colorings of planar graphs without 5-cycles
- A linear time algorithm to compute vertices that belong to all, some and no minimum dominating sets in a tree and its consequences
- A simple algorithm for scheduling unit jobs with unknown number of machines
- Solving the multiobjective quasi-clique problem
- Scheduling of e-commerce packaging machines: blocking machines and their impact on the performance-waste tradeoff
- An improved bound on the chromatic number of the pancake graphs
- Bin packing with thresholds: mathematical models and theoretical results
- Equitable connected partition and structural parameters revisited: N-fold beats Lenstra
- Ensuring connectedness for the maximum quasi-clique and densest k-subgraph problems
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)
