The following pages link to (Q4495496):
Displayed 50 items.
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034) (← links)
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue (Q1908990) (← links)
- Scatter search and star-paths: Beyond the genetic metaphor (Q1908997) (← links)
- Hybrid genetic algorithms for bin-packing and related problems (Q1919849) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Designing and reporting on computational experiments with heuristic methods (Q1922625) (← links)
- Parallel local search (Q1922627) (← links)
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs (Q1922632) (← links)
- TABU search methodology in global optimization (Q1962982) (← links)
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes (Q1972019) (← links)
- Geometric and LP-based heuristics for angular travelling salesman problems in the plane (Q2003422) (← links)
- Optimal RSUs placement with delay bounded message dissemination in vehicular networks (Q2012886) (← links)
- Joint optimization of budget allocation and maintenance planning of multi-facility transportation infrastructure systems (Q2028873) (← links)
- Genetic algorithm of tournament crowding based on Gaussian mutation (Q2215291) (← links)
- Towards a robuster interpretive parsing. Learning from overt forms in optimality theory (Q2255213) (← links)
- Heuristic algorithms for the cardinality constrained efficient frontier (Q2275807) (← links)
- A hybrid particle swarm optimization and genetic algorithm for closed-loop supply chain network design in large-scale networks (Q2278781) (← links)
- Parsimonious periodic autoregressive models for time series with evolving trend and seasonality (Q2302470) (← links)
- Omega-CVaR portfolio optimization and its worst case analysis (Q2362174) (← links)
- A simulated annealing approach to the solution of job rotation scheduling problems (Q2371395) (← links)
- Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle (Q2387245) (← links)
- Multi-objective optimization problems with fuzzy relation equation constraints regarding Max-average composition (Q2390038) (← links)
- Application of new double side approach method to the solution of super-elliptical plate problems (Q2392292) (← links)
- Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data (Q2433556) (← links)
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments (Q2433800) (← links)
- Lot sizing and furnace scheduling in small foundries (Q2456652) (← links)
- A simulated annealing algorithm for transient optimization in gas networks (Q2466789) (← links)
- The travelling salesman problem with precedence constraints. (Q2467824) (← links)
- Constraint satisfaction methods for solving the staff transfer problem (Q2476428) (← links)
- An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops (Q2482377) (← links)
- On-line resources allocation for ATM networks with rerouting (Q2489130) (← links)
- Dynamics of local search trajectory in traveling salesman problem (Q2491325) (← links)
- Solving the flight perturbation problem with meta heuristics (Q2491332) (← links)
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (Q2496041) (← links)
- Multi-regime models for nonlinear nonstationary time series (Q2512790) (← links)
- A simulated annealing algorithm for determining the thickness of a graph (Q2568255) (← links)
- Principles of scatter search (Q2570141) (← links)
- ``MOSS'' multiobjective scatter search applied to nonlinear multiple criteria optimization (Q2570146) (← links)
- Applying the double side method of weighted residual to the solution of shell deformation problem (Q2570741) (← links)
- A tabu search heuristic for the truck and trailer routing problem (Q2571183) (← links)
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems (Q2572256) (← links)
- Heuristics for the maximum outerplanar subgraph problem (Q2573002) (← links)
- The capacitated centred clustering problem (Q2581607) (← links)
- A hybrid meta-heuristic for multi-objective optimization: MOSATS (Q2643719) (← links)
- A hybrid genetic algorithm for the two-dimensional single large object placement problem (Q2643949) (← links)
- The hyperbolic smoothing clustering method (Q2654237) (← links)
- Applying available-to-promise (ATP) concept in mixed-model assembly line sequencing problems in a make-to-order (MTO) environment: problem extension, model formulation and Lagrangian relaxation algorithm (Q2656500) (← links)
- Matching formulation of the staff transfer problem: meta-heuristic approaches (Q2656523) (← links)
- Memory and Learning in Metaheuristics (Q2866122) (← links)