J
J. M. Valério de Carvalho
Researcher at University of Minho
Publications - 49
Citations - 1456
J. M. Valério de Carvalho is an academic researcher from University of Minho. The author has contributed to research in topics: Cutting stock problem & Column generation. The author has an hindex of 17, co-authored 48 publications receiving 1288 citations.
Papers
More filters
Journal ArticleDOI
Exact solution of bin‐packing problems using column generation and branch‐and‐bound
TL;DR: The linear relaxation of this model provides a strong lower bound for the bin‐packing problem and leads to tractable branch‐and‐bound trees for the instances under consideration.
Journal ArticleDOI
LP models for bin packing and cutting stock problems
TL;DR: Several linear programming formulations for the one-dimensional cutting stock and bin packing problems are reviewed, including the models of Kantorovich, Gilmore–Gomory, onecut models, as in the Dyckhoff–Stadtler approach, position-indexed models, and a model derived from the vehicle routing literature.
Journal ArticleDOI
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
TL;DR: In this article, the authors proposed an iterative exact algorithm for vehicle routing with time windows and multiple routes, which considers that a given vehicle can be assigned to more than one route per planning period.
Journal ArticleDOI
An integer programming model for two- and three-stage two-dimensional cutting stock problems
TL;DR: An integer programming model for two-dimensional cutting stock problems is proposed, which can be seen as an extension of the "one-cut model" proposed by Dyckhoff for the one-dimensionalcutting stock problem.
Journal ArticleDOI
Arc-flow model for the two-dimensional guillotine cutting stock problem
TL;DR: This paper describes an exact model for the two-dimensional cutting stock problem with two stages and the guillotine constraint, an integer linear programming (ILP) arc-flow model, formulated as a minimum flow problem, and derives a new family of cutting planes and a new lower bound.