Skip to main content

6 Result(s)

within J M Valério de Carvalho Remove this filter

and

  1. No Access

    Article

    Integrating two-dimensional cutting stock and lot-sizing problems

    The two-dimensional cutting stock problem (2DCSP) consists in the minimization of the number of plates used to cut a set of items. In industry, typically, an instance of this problem is considered at the beginnin...

    E Silva, F Alvelos, J M Valério de Carvalho in Journal of the Operational Research Society (2014)

  2. No Access

    Article

    Worst-case analysis of maximal dual feasible functions

    Dual feasible functions have been used to compute fast lower bounds and valid inequalities for integer linear problems. In this paper, we analyze the worst-case performance of the lower bounds provided by some...

    Jürgen Rietz, Cláudio Alves, J. M. Valério de Carvalho in Optimization Letters (2012)

  3. No Access

    Article

    New integer programming formulations and an exact algorithm for the ordered cutting stock problem

    Apart from trim loss minimization, there are many other issues concerning cutting processes that arise in real production systems. One of these is related to the number of stacks that need to be opened near th...

    C Alves, J M Valério de Carvalho in Journal of the Operational Research Society (2008)

  4. No Access

    Article

    A Note on Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problems

    One algorithm proposed in “Branch-and-price algorithms for the one-dimensional cutting stock problems” (COAP, vol. 9, pp. 211–228, 1998) may not find an optimal solution to the cutting stock problem, as it is sta...

    J.M. Valério de Carvalho in Computational Optimization and Applications (2002)

  5. No Access

    Article

    Exact solution of bin‐packing problems using column generation and branch‐and‐bound

    We explore an arc flow formulation with side constraints for the one‐dimensionalbin‐packing problem. The model has a set of flow conservation constraints and a set ofconstraints that force the appropriate numb...

    J.M. Valério de Carvalho in Annals of Operations Research (1999)

  6. No Access

    Chapter and Conference Paper

    A Nonlinear Two-Stage Cutting Stock Problem

    In this communication, we present a two-stage cutting stock system that arises in a make-to-order steel industry. Orders are accepted on a monthly basis, and planning and production must be completed within a ...

    J. M. Valério de Carvalho, A. J. Guimarães Rodrigues in Combinatorial Optimization (1992)