The following pages link to Vittorio Maniezzo (Q237400):
Displaying 36 items.
- Algorithms for nesting with defects (Q406491) (← links)
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities (Q953311) (← links)
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem (Q1130046) (← links)
- A bionomic approach to the capacitated \(p\)-median problem (Q1273663) (← links)
- Metaheuristics for high school timetabling (Q1380726) (← links)
- Route relaxations on GPU for vehicle routing problems (Q1751660) (← links)
- Metaheuristic search techniques for multi-objective and stochastic problems: a history of the inventions of Walter J. Gutjahr in the past 22 years (Q1787914) (← links)
- A distributed geographic information system for the daily car pooling problem (Q1886004) (← links)
- Parallel simulation of a cellular pollution model (Q1923375) (← links)
- The project scheduling problem with irregular starting time costs (Q1969764) (← links)
- Predictive analytics for real-time auction bidding support: a case on fantasy football (Q2079289) (← links)
- Matheuristics. Algorithms and implementations (Q2246150) (← links)
- Benders decomposition, Lagrangean relaxation and metaheuristic design (Q2271124) (← links)
- A genetic/tabu thresholding hybrid algorithm for the process allocation problem (Q2567844) (← links)
- (Q2770488) (← links)
- Ant colony optimization: An overview (Q2776571) (← links)
- An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation (Q2783969) (← links)
- Using GPU computing for solving the two-dimensional guillotine cutting problem (Q2830956) (← links)
- A fully distributed Lagrangean solution for a peer-to-peer overlay network design problem (Q2899105) (← links)
- Exact methods based on node-routing formulations for undirected arc-routing problems (Q3376660) (← links)
- VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH (Q3393492) (← links)
- Algorithms for Large Directed Capacitated Arc Routing Problem Instances (Q3625023) (← links)
- An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation (Q3637437) (← links)
- (Q4035642) (← links)
- (Q4319398) (← links)
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem (Q4427381) (← links)
- (Q4667331) (← links)
- (Q4667342) (← links)
- (Q4672475) (← links)
- Client-side Computational Optimization (Q5237432) (← links)
- A set covering based matheuristic for a real‐world city logistics problem (Q5246831) (← links)
- Cellular Automata and Roundabout Traffic Simulation (Q5464081) (← links)
- Heuristics from Nature for Hard Combinatorial Optimization Problems (Q5690286) (← links)
- (Q5692625) (← links)
- A new method for solving capacitated location problems based on a set partitioning approach (Q5959081) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
