Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187)

From MaRDI portal

Revision as of 05:47, 2 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Hybridizing exact methods and metaheuristics: a taxonomy	scientific article

Statements

scholarly article

0 references

Hybridizing exact methods and metaheuristics: a taxonomy (English)

0 references

European Journal of Operational Research

0 references

publication date

7 December 2009

0 references

zbMATH Keywords

taxonomy

0 references

combinatorial optimisation

0 references

metaheuristics

0 references

exact methods

0 references

Laetitia Jourdan

0 references

Matthieu Basseur

0 references

El-Ghazali Talbi

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2007.07.035

0 references

0 references

Separating capacity constraints in the CVRP using tabu search

0 references

A survey of very large-scale neighborhood search techniques

0 references

\(\alpha BB\): A global optimization method for general constrained nonconvex problems

0 references

A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems

0 references

0 references

A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem

0 references

Branch-and-Price: Column Generation for Solving Huge Integer Programs

0 references

A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows

0 references

Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling

0 references

Upper and lower bounds for the single source capacitated location problem.

0 references

A Simplex-Based Tabu Search Method for Capacitated Network Design

0 references

Embedded local search approaches for routing optimization

0 references

An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem

0 references

A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions

0 references

Embedding branch and bound within evolutionary algorithms

0 references

Solving vehicle routing problems using constraint programming and metaheuristics

0 references

Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection

0 references

Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems

0 references

0 references

0 references

Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems

0 references

A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems

0 references

Future paths for integer programming and links to artificial intelligence

0 references

Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming

0 references

Outline of an algorithm for integer solutions to linear programs

0 references

A branch-and-bound-based local search method for the flow shop problem

0 references

0 references

0 references

Genetic Programming

0 references

Optimization by Simulated Annealing

0 references

0 references

A new class of hybrid global optimization algorithms for peptide structure prediction: integrated hybrids

0 references

0 references

A Hybrid Genetic/Optimization Algorithm for Finite-Horizon, Partially Observed Markov Decision Processes

0 references

Branch-and-Bound Methods: A Survey

0 references

Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem

0 references

A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound

0 references

A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem

0 references

Linear programming based meta-heuristics for the weighted maximal planar graph

0 references

LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search

0 references

A constraint programming framework for local search methods

0 references

Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem

0 references

0 references

A hybrid search combining interior point methods and metaheuristics for 0-1 programming

0 references

Branch and bound crossed with GA to solve hybrid flowshops

0 references

Heuristic concentration: Two stage solution construction

0 references

Asynchronous teams: cooperation schemes for autonomous agents

0 references

An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem

0 references

0 references

One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.ejor.2007.07.035

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1042187

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1042187&oldid=35141612"