Pages that link to "Item:Q4904874"
From MaRDI portal
The following pages link to Handbook of Combinatorial Optimization (Q4904874):
Displaying 26 items.
- A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems (Q266014) (← links)
- Tabu search for the cyclic bandwidth problem (Q337475) (← links)
- Equitable colorings of Cartesian products with balanced complete multipartite graphs (Q476328) (← links)
- Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach (Q1730665) (← links)
- Properties of combinatorial optimization problems over polyhedral-spherical sets (Q1745702) (← links)
- Equitable neighbour-sum-distinguishing edge and total colourings (Q1786869) (← links)
- Two-dimensional knapsack-block packing problem (Q1984921) (← links)
- A two-step method for solving vector optimization problems on permutation configuration (Q2044039) (← links)
- Fair integral submodular flows (Q2166258) (← links)
- A method to solve conditional optimization problems with quadratic objective functions on the set of permutations (Q2215299) (← links)
- Theory and methods of Euclidian combinatorial optimization: current status and prospects (Q2215570) (← links)
- Solutions of the combinatorial problem with a quadratic fractional objective function on the set of permutations (Q2215587) (← links)
- An interactive approach for solving the multiobjective minimum cost flow problem in the fuzzy environment (Q2225554) (← links)
- Minimum non-submodular cover problem with applications (Q2245054) (← links)
- A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization (Q2312327) (← links)
- $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices (Q2832890) (← links)
- Allocating resources via price management systems: a dynamic programming-based approach (Q5018825) (← links)
- Two faces of greedy leaf removal procedure on graphs (Q5132111) (← links)
- Modelling and solving resource allocation problems via a dynamic programming approach (Q5157967) (← links)
- Comparison of metaheuristics for the <i>k</i>‐labeled spanning forest problem (Q5278227) (← links)
- The maximum feasible subset problem (maxFS) and applications (Q5884385) (← links)
- 2-edge connected dominating sets and 2-connected dominating sets of a graph (Q5963646) (← links)
- A local algorithm and its percolation analysis of bipartite z-matching problem (Q6058939) (← links)
- Research trends in combinatorial optimization (Q6091419) (← links)
- Sensitivity analysis of combinatorial optimization problems using evolutionary bilevel optimization and data mining (Q6113074) (← links)
- Edge searching and fast searching with constraints (Q6122599) (← links)
