The following pages link to Matheuristics (Q3654149):
Displayed 50 items.
- POPMUSIC as a matheuristic for the berth allocation problem (Q276540) (← links)
- New results for the directed profitable rural postman problem (Q296876) (← links)
- An integer programming approach to the multimode resource-constrained multiproject scheduling problem (Q310345) (← links)
- A hybrid heuristic approach for single machine scheduling with release times (Q336949) (← links)
- Combining matheuristics and MILP to solve the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) (Q337057) (← links)
- A fix-and-optimize heuristic for the high school timetabling problem (Q337176) (← links)
- Heuristics for dynamic and stochastic inventory-routing (Q337178) (← links)
- A hybrid method for the probabilistic maximal covering location-allocation problem (Q337483) (← links)
- A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem (Q338852) (← links)
- Lower and upper bounds for the bin packing problem with fragile objects (Q406499) (← links)
- A hybrid algorithm for the DNA sequencing problem (Q406500) (← links)
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem (Q439317) (← links)
- A mathematical formulation and complexity considerations for the blocks relocation problem (Q439616) (← links)
- Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs (Q521579) (← links)
- Models for a traveling purchaser problem with additional side-constraints (Q709202) (← links)
- A VNS-LP algorithm for the robust dynamic maximal covering location problem (Q1642060) (← links)
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem (Q1652233) (← links)
- A matheuristic for the two-stage fixed-charge transportation problem (Q1652635) (← links)
- An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty (Q1652700) (← links)
- A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations (Q1695784) (← links)
- Matheuristics for optimizing the network in German wagonload traffic (Q1707082) (← links)
- Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure (Q1730745) (← links)
- Staff assignment with lexicographically ordered acceptance levels (Q1743648) (← links)
- Generalized local branching heuristics and the capacitated ring tree problem (Q1744240) (← links)
- A matheuristic for the cell formation problem (Q1744631) (← links)
- Optimal sensor deployment to increase the security of the maximal breach path in border surveillance (Q1751769) (← links)
- An efficient matheuristic for offline patient-to-bed assignment problems (Q1754343) (← links)
- Heuristic optimisation in financial modelling (Q1931632) (← links)
- A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem (Q1955409) (← links)
- Models and algorithms for optimising two-dimensional LEGO constructions (Q2028820) (← links)
- Combining workload balance and patient priority maximisation in operating room planning through hierarchical multi-objective optimisation (Q2076840) (← links)
- Assembly line balancing: what happened in the last fifteen years? (Q2140264) (← links)
- A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes (Q2178911) (← links)
- Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem (Q2185833) (← links)
- A matheuristic approach to large-scale avionic scheduling (Q2241154) (← links)
- A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing (Q2248555) (← links)
- A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
- Workforce routing and scheduling for electricity network maintenance with downtime minimization (Q2356225) (← links)
- A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136) (← links)
- A multiplicative weights update algorithm for MINLP (Q2397756) (← links)
- Heuristic approaches for support vector machines with the ramp loss (Q2448185) (← links)
- A Lagrangian-ACO matheuristic for car sequencing (Q2513756) (← links)
- A hybrid algorithm for the drilling rig routing problem (Q5100126) (← links)
- Matheuristics for the capacitated p‐median problem (Q5246830) (← links)
- Comparison of metaheuristics for the <i>k</i>‐labeled spanning forest problem (Q5278227) (← links)
- Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015 (Q5879644) (← links)
- Dynamic programming based metaheuristics for the dial-a-ride problem (Q5963101) (← links)
- Lagrangian heuristics for the quadratic knapsack problem (Q5963311) (← links)
- Grocery distribution plans in urban networks with street crossing penalties (Q6065827) (← links)
- Heuristics for flights arrival scheduling at airports (Q6071058) (← links)