The following pages link to Pedro Augusto Munari (Q610972):
Displaying 28 items.
- (Q266407) (redirect page) (← links)
- Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
- A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes (Q319637) (← links)
- Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
- On the cutting stock problem under stochastic demand (Q610975) (← links)
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
- A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration (Q1711440) (← links)
- Pickup and delivery problem with time windows: a new compact two-index formulation (Q1728253) (← links)
- A MIP model for freight consolidation in road transportation considering outsourced fleet (Q2089621) (← links)
- The vehicle allocation problem: alternative formulation and branch-and-price method (Q2147070) (← links)
- Decomposition-based algorithms for the crew scheduling and routing problem in road restoration (Q2177830) (← links)
- A column generation-based heuristic for the split delivery vehicle routing problem with time windows (Q2226483) (← links)
- New developments in the primal-dual column generation technique (Q2253404) (← links)
- Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products (Q2286968) (← links)
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem (Q2289918) (← links)
- Robust optimization for the vehicle routing problem with multiple deliverymen (Q2323425) (← links)
- Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen (Q2664412) (← links)
- A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service (Q2673569) (← links)
- A robust optimization approach for the unrelated parallel machine scheduling problem (Q2701168) (← links)
- A note on the primal-dual column generation method for combinatorial optimization (Q2840728) (← links)
- Iterated local search and simulated annealing algorithms for the inventory routing problem (Q4624897) (← links)
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern (Q6067889) (← links)
- Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm (Q6106600) (← links)
- An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands (Q6167539) (← links)
- A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery (Q6565397) (← links)
- An exact method for a last-mile delivery routing problem with multiple deliverymen (Q6572895) (← links)
- Hierarchical goal programming approaches to solve a discrete-time formulation for the aircraft recovery problem of a Brazilian oil and gas company (Q6659816) (← links)
