Matheuristics
From MaRDI portal
Publication:3654149
DOI10.1007/978-1-4419-1306-7zbMath1179.90007OpenAlexW4229675399MaRDI QIDQ3654149
No author found.
Publication date: 5 January 2010
Published in: Annals of Information Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4419-1306-7
Applications of mathematical programming (90C90) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items (50)
Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015 ⋮ A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem ⋮ Comparison of metaheuristics for the k‐labeled spanning forest problem ⋮ POPMUSIC as a matheuristic for the berth allocation problem ⋮ New results for the directed profitable rural postman problem ⋮ Assembly line balancing: what happened in the last fifteen years? ⋮ An integer programming approach to the multimode resource-constrained multiproject scheduling problem ⋮ A VNS-LP algorithm for the robust dynamic maximal covering location problem ⋮ A hybrid heuristic approach for single machine scheduling with release times ⋮ Combining matheuristics and MILP to solve the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) ⋮ A fix-and-optimize heuristic for the high school timetabling problem ⋮ Heuristics for dynamic and stochastic inventory-routing ⋮ A hybrid method for the probabilistic maximal covering location-allocation problem ⋮ An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem ⋮ A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem ⋮ A matheuristic for the two-stage fixed-charge transportation problem ⋮ An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty ⋮ A multiplicative weights update algorithm for MINLP ⋮ A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes ⋮ Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem ⋮ Heuristic optimisation in financial modelling ⋮ A hybrid algorithm for the drilling rig routing problem ⋮ Grocery distribution plans in urban networks with street crossing penalties ⋮ Heuristics for flights arrival scheduling at airports ⋮ Lower and upper bounds for the bin packing problem with fragile objects ⋮ A hybrid algorithm for the DNA sequencing problem ⋮ A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations ⋮ An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem ⋮ A mathematical formulation and complexity considerations for the blocks relocation problem ⋮ Matheuristics for optimizing the network in German wagonload traffic ⋮ A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem ⋮ Heuristic approaches for support vector machines with the ramp loss ⋮ Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure ⋮ Staff assignment with lexicographically ordered acceptance levels ⋮ Generalized local branching heuristics and the capacitated ring tree problem ⋮ A matheuristic for the cell formation problem ⋮ A matheuristic approach to large-scale avionic scheduling ⋮ Optimal sensor deployment to increase the security of the maximal breach path in border surveillance ⋮ A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing ⋮ Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs ⋮ An efficient matheuristic for offline patient-to-bed assignment problems ⋮ Models for a traveling purchaser problem with additional side-constraints ⋮ Models and algorithms for optimising two-dimensional LEGO constructions ⋮ Dynamic programming based metaheuristics for the dial-a-ride problem ⋮ Lagrangian heuristics for the quadratic knapsack problem ⋮ A Lagrangian-ACO matheuristic for car sequencing ⋮ A binarisation heuristic for non-convex quadratic programming with box constraints ⋮ Combining workload balance and patient priority maximisation in operating room planning through hierarchical multi-objective optimisation ⋮ Matheuristics for the capacitated p‐median problem ⋮ Workforce routing and scheduling for electricity network maintenance with downtime minimization
This page was built for publication: Matheuristics
