Pages that link to "Item:Q2654395"
From MaRDI portal
The following pages link to Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs (Q2654395):
Displaying 22 items.
- A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (Q274945) (← links)
- A heuristic for BILP problems: the single source capacitated facility location problem (Q296777) (← links)
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems (Q319659) (← links)
- Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
- Model-based automatic neighborhood design by unsupervised learning (Q337347) (← links)
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems (Q339582) (← links)
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration (Q1652297) (← links)
- Adaptive kernel search: a heuristic for solving mixed integer linear programs (Q1694819) (← links)
- Variable neighborhood search: basics and variants (Q1707084) (← links)
- Generalized local branching heuristics and the capacitated ring tree problem (Q1744240) (← links)
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
- Revenue maximization of Internet of things provider using variable neighbourhood search (Q2022217) (← links)
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs (Q2064299) (← links)
- Timetable coordination in a rail transit network with time-dependent passenger demand (Q2239858) (← links)
- A novel solution approach with ML-based pseudo-cuts for the flight and maintenance planning problem (Q2241911) (← links)
- Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
- A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems (Q2840764) (← links)
- Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility (Q2883646) (← links)
- Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems (Q6069740) (← links)
- Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints (Q6088241) (← links)
- Assigning Team Tasks and Multiple Activities to Fixed Work Shifts (Q6160387) (← links)
- Variable neighborhood search: the power of change and simplicity (Q6164603) (← links)
