Pages that link to "Item:Q5382675"
From MaRDI portal
The following pages link to Parallel variable neighbourhood search strategies for the cutwidth minimization problem (Q5382675):
Displaying 19 items.
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search (Q1652609) (← links)
- A hybrid CPU-GPU parallelization scheme of variable neighborhood search for inventory optimization problems (Q1687632) (← links)
- A variable neighborhood search approach for the crew pairing problem (Q1687651) (← links)
- Variable neighborhood descent for the incremental graph drawing (Q1687677) (← links)
- Variable neighborhood scatter search for the incremental graph drawing problem (Q1694406) (← links)
- General variable neighborhood search for the order batching and sequencing problem (Q1695017) (← links)
- GRASP and VNS for solving the \(p\)-next center problem (Q1725619) (← links)
- GRASP with variable neighborhood descent for the online order batching problem (Q2022211) (← links)
- Multistart search for the cyclic cutwidth minimization problem (Q2026984) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- On solving the order processing in picking workstations (Q2070114) (← links)
- A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem (Q2070130) (← links)
- A general variable neighborhood search for the cyclic antibandwidth problem (Q2114825) (← links)
- A variable neighborhood search approach for the vertex bisection problem (Q2201641) (← links)
- Packing a fixed number of identical circles in a circular container with circular prohibited areas (Q2329665) (← links)
- Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies (Q2631232) (← links)
- In memory of Professor Nenad Mladenović (1951--2022) (Q2677361) (← links)
- A parallel variable neighborhood search approach for the obnoxious <i>p</i>‐median problem (Q6088247) (← links)
- Population-based iterated greedy algorithm for the S-labeling problem (Q6164608) (← links)
