The following pages link to Roberto Musmanno (Q337419):
Displaying 42 items.
- (Q174599) (redirect page) (← links)
- A decomposition-based heuristic for the multiple-product inventory-routing problem (Q337420) (← links)
- Modeling and solving the mixed capacitated general routing problem (Q375984) (← links)
- Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions (Q702760) (← links)
- Robust scheduling of parallel machines with sequence-dependent set-up costs (Q706962) (← links)
- Improved formulation, branch-and-cut and tabu search heuristic for single loop material flow system design (Q857364) (← links)
- A model of efficient asynchronous parallel algorithms on multicomputer systems (Q1185915) (← links)
- A parallel asynchronous Newton algorithm for unconstrained optimization (Q1321336) (← links)
- Efficient parallel algorithms for the minimum cost flow problem (Q1379929) (← links)
- Parallel algorithm for unconstrained optimization based on decomposition techniques (Q1379930) (← links)
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. (Q1406947) (← links)
- Solving stochastic linear programs with restricted recourse using interior point methods (Q1567483) (← links)
- A heuristic for the periodic rural postman problem (Q1885936) (← links)
- Convergence and numerical results for a parallel asynchronous quasi- Newton method (Q1893309) (← links)
- Parallel asynchronous label-correcting methods for shortest paths (Q1908632) (← links)
- The capacitated plant location problem with multiple facilities in the same site (Q1941959) (← links)
- Parallel asynchronous algorithms for the \(K\) shortest paths problem (Q1973483) (← links)
- The risk-averse traveling repairman problem with profits (Q2317622) (← links)
- Solving the shortest path tour problem (Q2356016) (← links)
- A combined procedure for discrete simulation-optimization problems based on the simulated annealing framework (Q2457953) (← links)
- A queuing network model for the management of berth crane operations (Q2471220) (← links)
- A constructive heuristic for the undirected rural postman problem (Q2496045) (← links)
- The mixed capacitated general routing problem under uncertainty (Q2629641) (← links)
- Arc routing under uncertainty: introduction and literature review (Q2669541) (← links)
- Computational experiments with scaled initial hessian approximation for the broyden family methods<sup>∗</sup> (Q2709452) (← links)
- (Q2865874) (← links)
- Batch scheduling in a two-stage flow shop with parallel and bottleneck machines (Q3021820) (← links)
- Allocating production batches to subcontractors by fuzzy goal programming (Q3044041) (← links)
- On the performance of switching BFGS/SR1 algorithms for unconstrained optimization (Q3156720) (← links)
- A multistage formulation for generation companies in a multi-auction electricity market (Q3557592) (← links)
- EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM (Q3580197) (← links)
- A Class of Label-Correcting Methods for the K Shortest Paths Problem (Q3635012) (← links)
- (Q4352996) (← links)
- A Lagrangean heuristic for the plant location problem with multiple facilities in the same site (Q4405938) (← links)
- The Arc Routing and Scheduling Problem with Transshipment (Q4408700) (← links)
- Scheduling in dial-indexed production lines (Q4474678) (← links)
- (Q4999375) (← links)
- A three-stage load balancing model in a manufacturing company (Q5293419) (← links)
- Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem (Q5463668) (← links)
- Parallel algorithms for solving the convex minimum cost flow problem (Q5931039) (← links)
- Label correcting methods to solve multicriteria shortest path problems (Q5956971) (← links)
- Selection of cultural sites via optimization (Q6619787) (← links)
