Combining metaheuristics with mathematical programming, constraint programming and machine learning
From MaRDI portal
Publication:5891242
DOI10.1007/s10288-013-0242-3zbMath1273.90004OpenAlexW2045442495MaRDI QIDQ5891242
Publication date: 21 October 2013
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-013-0242-3
mathematical programmingdata miningmachine learningconstraint programminghybrid metaheuristicsmatheuristics
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (6)
Twelve surveys in operations research ⋮ Surveys in operations research ⋮ Parameter tuning for local-search-based matheuristic methods ⋮ Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ A matheuristic approach for solving the 2-connected dominating set problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel recombinative simulated annealing: A genetic algorithm
- Knowledge incorporation in evolutionary computation
- A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions
- A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound
- Hybridizing exact methods and metaheuristics: a taxonomy
- Partitioning procedures for solving mixed-variables programming problems
- A GRASP for a difficult single machine scheduling problem
- Large-step Markov chains for the TSP incorporating local search heuristics
- Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
- Heuristic concentration: Two stage solution construction
- Exponential neighbourhood local search for the traveling salesman problem
- A new adaptive multi-start technique for combinatorial global optimizations
- An analysis of parallel heuristics for task allocation in multicomputers
- Constraint-based job shop scheduling with Ilog Scheduler
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- Heuristic methods for large centroid clustering problems
- Local branching
- Learnable evolution model: Evolutionary processes guided by machine learning
- Nurse scheduling with tabu search and strategic oscillation
- Separating capacity constraints in the CVRP using tabu search
- Greedy randomized adaptive search procedures
- Variable neighborhood decomposition search
- Combining the scalability of local search with the pruning techniques of systematic search
- A constraint programming framework for local search methods
- Heuristics for large constrained vehicle routing problems
- Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
- A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
- Genetic and hybrid algorithms for graph coloring
- Parallel local search
- Solving various weighted matching problems with constraints
- COSEARCH: A parallel cooperative metaheuristic
- Hybridization of GRASP metaheuristic with data mining techniques
- Asynchronous teams: cooperation schemes for autonomous agents
- A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
- Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Tour Merging via Branch-Decomposition
- Solving a nurse scheduling problem with knapsacks, networks and tabu search
- Outline of an algorithm for integer solutions to linear programs
- A Linear Programming Approach to the Cutting-Stock Problem
- Principles of Constraint Programming
- A Greedy Heuristic for the Set-Covering Problem
- A Computational Study of the Job-Shop Scheduling Problem
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- Parallel iterative search methods for vehicle routing problems
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- Optimized Crossover for the Independent Set Problem
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
- Local Search and Constraint Programming
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- Parallel Strategies for Meta-Heuristics
- An effective heuristic for the CLSP with set-up times
- Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms
- Learning representations by back-propagating errors
- Genetic Programming
- Simultaneously applying multiple mutation operators in genetic algorithms
- Adaptive memory programming: a unified view of metaheuristics
This page was built for publication: Combining metaheuristics with mathematical programming, constraint programming and machine learning
