Pages that link to "Item:Q1850963"
From MaRDI portal
The following pages link to Variable neighborhood decomposition search (Q1850963):
Displayed 22 items.
- Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks (Q310353) (← links)
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
- Single string planning problem arising in liner shipping industries: a heuristic approach (Q336521) (← links)
- An effective matheuristic for the capacitated total quantity discount problem (Q336744) (← links)
- Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← 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)
- The stochastic capacitated branch restructuring problem (Q512982) (← links)
- Fast modified global \(k\)-means algorithm for incremental cluster construction (Q621088) (← links)
- Variable neighborhood search for harmonic means clustering (Q636511) (← links)
- An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system (Q781099) (← links)
- Heuristic procedures for solving the discrete ordered median problem (Q816415) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation (Q853887) (← links)
- The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
- Learning multicriteria fuzzy classification method PROAFTN from data (Q868128) (← links)
- Computational study of large-scale \(p\)-median problems (Q868446) (← links)
- Application of the cross-entropy method to clustering and vector quantization (Q868638) (← links)
- An effective VNS for the capacitated \(p\)-median problem (Q932177) (← links)
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem (Q932185) (← links)
- Combining VNS with constraint programming for solving anytime optimization problems (Q932188) (← links)
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search (Q933803) (← links)