The following pages link to José M. Valério de Carvalho (Q1025239):
Displaying 47 items.
- (Q241764) (redirect page) (← links)
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem (Q297181) (← links)
- Skewed general variable neighborhood search for the location routing scheduling problem (Q337608) (← links)
- An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling (Q342571) (← links)
- On the extremality of maximal dual feasible functions (Q433834) (← links)
- A survey of dual-feasible and superadditive functions (Q610986) (← links)
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model (Q635160) (← links)
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times (Q853028) (← links)
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
- Theoretical investigations on maximal dual feasible functions (Q974987) (← links)
- An integer programming model for two- and three-stage two-dimensional cutting stock problems (Q976382) (← links)
- New lower bounds based on column generation and constraint programming for the pattern minimization problem (Q1025240) (← links)
- An LP-based approach to a two-stage cutting stock problem (Q1127213) (← links)
- Exact solution of bin-packing problems using column generation and branch-and-bound (Q1290171) (← links)
- Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound (Q1665694) (← links)
- A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints (Q1680068) (← links)
- Variable neighborhood search algorithms for pickup and delivery problems with loading constraints (Q1687656) (← links)
- Column generation based primal heuristics for routing and loading problems (Q1742212) (← links)
- Column generation based approaches for combined routing and scheduling (Q1742215) (← links)
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
- Constructing general dual-feasible functions (Q1785396) (← links)
- LP models for bin packing and cutting stock problems (Q1847189) (← links)
- Worst-case analysis of maximal dual feasible functions (Q1926616) (← links)
- A variable neighborhood search algorithm for the leather nesting problem (Q1954576) (← links)
- An exact algorithm for bilevel 0-1 knapsack problems (Q1954852) (← links)
- Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups (Q2080827) (← links)
- Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
- Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications (Q2634938) (← links)
- Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
- Arc-flow model for the two-dimensional guillotine cutting stock problem (Q2654387) (← links)
- An integer programming model for the Minimum Interval Graph Completion Problem (Q2883618) (← links)
- Using Extra Dual Cuts to Accelerate Column Generation (Q2890465) (← links)
- New Stabilization Procedures for the Cutting Stock Problem (Q2899145) (← links)
- (Q3107598) (← links)
- A branch-and-price-and-cut algorithm for the pattern minimization problem (Q3163667) (← links)
- Dual-Optimal Inequalities for Stabilized Column Generation (Q3391991) (← links)
- New integer programming formulations and an exact algorithm for the ordered cutting stock problem (Q3394020) (← links)
- Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem (Q3562403) (← links)
- An extended model and a column generation algorithm for the planar multicommodity flow problem (Q3593364) (← links)
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound (Q4212712) (← links)
- A Computer Based Interactive Approach To A Two-Stage Cutting Stock Problem (Q4834076) (← links)
- Cutting Stock Problems (Q5493630) (← links)
- A note on ``Branch-and-price algorithms for the one-dimensional cutting stock problems'' (Q5961072) (← links)
- Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls (Q6066723) (← links)
- A strong integer linear optimization model to the compartmentalized knapsack problem (Q6088168) (← links)
- An arc flow formulation to the multitrip production, inventory, distribution, and routing problem with time windows (Q6092533) (← links)
- A combinatorial flow-based formulation for temporal bin packing problems (Q6109803) (← links)
