The following pages link to Pasquale Avella (Q173869):
Displaying 29 items.
- Lifted and local reachability cuts for the vehicle routing problem with time windows (Q336427) (← links)
- (Q510287) (redirect page) (← links)
- A branch and cut heuristic for a runway scheduling problem (Q510289) (← links)
- A cutting plane algorithm for the capacitated facility location problem (Q842775) (← links)
- Computational study of large-scale \(p\)-median problems (Q868446) (← links)
- A computational study of a cutting plane algorithm for university course timetabling (Q880517) (← links)
- A computational study of local search algorithms for Italian high-school timetabling (Q930154) (← links)
- A computational study of exact knapsack separation for the generalized assignment problem (Q967219) (← links)
- Computational experience with general cutting planes for the set covering problem (Q1002077) (← links)
- An effective heuristic for large-scale capacitated facility location problems (Q1044245) (← links)
- Logical reduction tests for the p-problem (Q1290132) (← links)
- Solving a fuel delivery problem by heuristic and exact approaches. (Q1410332) (← links)
- An aggregation heuristic for large scale p-median problem (Q1762151) (← links)
- (Q1848353) (redirect page) (← links)
- A penalty function heuristic for the resource constrained shortest path problem (Q1848355) (← links)
- Resource constrained shortest path problems in path planning for fleet management (Q1876595) (← links)
- Weak flow cover inequalities for the capacitated facility location problem (Q2029027) (← links)
- A decomposition approach for a very large scale optimal diversity management problem (Q2386679) (← links)
- A Steiner arborescence model for the feeder reconfiguration in electric distribution networks (Q2387239) (← links)
- Metric inequalities and the network loading problem (Q2471279) (← links)
- A branch-and-cut algorithm for the median-path problem (Q2490367) (← links)
- A LP-based heuristic for a time-constrained routing problem (Q2491773) (← links)
- Computational testing of a separation procedure for the knapsack set with a single continuous variable (Q2815436) (← links)
- Near-optimal solutions of large-scale single-machine scheduling problems (Q2890466) (← links)
- Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances (Q4642458) (← links)
- (Q5708526) (← links)
- Integer Programming and Combinatorial Optimization (Q5712458) (← links)
- On the \(p\)-median polytope (Q5930734) (← links)
- A compact formulation for the base station deployment problem in wireless networks (Q6179723) (← links)
