The following pages link to Maurizio Boccia (Q330510):
Displaying 31 items.
- An implementation of exact knapsack separation (Q330511) (← links)
- Lifted and local reachability cuts for the vehicle routing problem with time windows (Q336427) (← links)
- (Q510288) (redirect page) (← links)
- A branch and cut heuristic for a runway scheduling problem (Q510289) (← links)
- A fast heuristic for a three-dimensional non-convex domain loading problem (Q538281) (← links)
- Flow intercepting facility location: Problems, models and heuristics (Q841607) (← links)
- A cutting plane algorithm for the capacitated facility location problem (Q842775) (← 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)
- Solving a fuel delivery problem by heuristic and exact approaches. (Q1410332) (← links)
- Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm (Q1652448) (← links)
- An aggregation heuristic for large scale p-median problem (Q1762151) (← links)
- (Q1848354) (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)
- Polyhedral study of simple plant location problem with order (Q1949680) (← links)
- Weak flow cover inequalities for the capacitated facility location problem (Q2029027) (← links)
- An optimization-based approach to assess non-interference in labeled and bounded Petri net systems (Q2123401) (← links)
- A decomposition approach for a very large scale optimal diversity management problem (Q2386679) (← links)
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes (Q2481606) (← links)
- A branch-and-cut algorithm for the median-path problem (Q2490367) (← links)
- The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming (Q2811317) (← 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)
- Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches (Q5148189) (← links)
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)
- The parallel AGV scheduling problem with battery constraints: a new formulation and a matheuristic approach (Q6109805) (← links)
- A new <i>MILP</i> formulation for the flying sidekick traveling salesman problem (Q6139381) (← links)
- Optimization for surgery department management: an application to a hospital in Naples (Q6619796) (← links)
