Pages that link to "Item:Q5937708"
From MaRDI portal
The following pages link to Variable neighborhood search: Principles and applications (Q5937708):
Displaying 50 items.
- A hybrid clonal selection algorithm for the location routing problem with stochastic demands (Q276534) (← links)
- A survey of recent research on location-routing problems (Q296678) (← links)
- Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
- Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks (Q310353) (← links)
- Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints (Q319021) (← links)
- Anytime Pareto local search (Q319099) (← links)
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems (Q319659) (← links)
- Exact and heuristic algorithms for the design of hub networks with multiple lines (Q319742) (← links)
- The multi-compartment vehicle routing problem with flexible compartment sizes (Q319854) (← links)
- Fast local search for single row facility layout (Q319872) (← links)
- Aggregation heuristic for the open-pit block scheduling problem (Q321137) (← links)
- The bipartite quadratic assignment problem and extensions (Q322542) (← links)
- A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem (Q322620) (← links)
- Nested general variable neighborhood search for the periodic maintenance problem (Q322899) (← links)
- A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
- A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
- Large neighborhood search for multi-trip vehicle routing (Q323545) (← links)
- A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem (Q336415) (← links)
- A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem (Q336733) (← links)
- A math-heuristic for the warehouse location-routing problem in disaster relief (Q336848) (← links)
- Location-arc routing problem: heuristic approaches and test instances (Q336937) (← links)
- A nested heuristic for parameter tuning in support vector machines (Q336941) (← links)
- Minimizing the total completion time in a distributed two stage assembly system with setup times (Q337027) (← links)
- A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department (Q337117) (← links)
- Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
- A fix-and-optimize heuristic for the high school timetabling problem (Q337176) (← links)
- A high performing metaheuristic for multi-objective flowshop scheduling problem (Q337199) (← links)
- A variable neighborhood search particle filter for bearings-only target tracking (Q337209) (← links)
- A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints (Q337213) (← links)
- A global optimisation approach for parameter estimation of a mixture of double Pareto lognormal and lognormal distributions (Q337215) (← links)
- Optimizing frequent time-window selection for association rules mining in a temporal database using a variable neighbourhood search (Q337219) (← links)
- A local search heuristic for the \((r| p)\)-centroid problem in the plane (Q337239) (← links)
- Skewed general variable neighborhood search for the location routing scheduling problem (Q337608) (← links)
- Bi-objective integrating sustainable order allocation and sustainable supply chain network strategic design with stochastic demand using a novel robust hybrid multi-objective metaheuristic (Q337636) (← links)
- Variable neighborhood search for location routing (Q339539) (← links)
- An efficient hybrid meta-heuristic for aircraft landing problem (Q339566) (← 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)
- Hybrid column generation and large neighborhood search for the dial-a-ride problem (Q339608) (← links)
- Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
- Heuristic approaches for scheduling jobs in large-scale flexible job shops (Q342300) (← links)
- A destroy and repair algorithm for the bike sharing rebalancing problem (Q342356) (← links)
- Variable neighborhood search for the second type of two-sided assembly line balancing problem (Q342398) (← links)
- The dynamic vehicle allocation problem with application in trucking companies in Brazil (Q342558) (← links)
- On the extremal properties of the average eccentricity (Q356266) (← links)
- An iterative approach for the serial batching problem with parallel machines and job families (Q363588) (← links)
- A recipe for finding good solutions to MINLPs (Q384810) (← links)
- Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← links)
- Adapting derivative free optimization methods to engineering models with discrete variables (Q400044) (← links)
- The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561) (← links)
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking (Q421715) (← links)
