Showing papers by "Silvano Martello published in 2005"
TL;DR: A characterization of the algorithm proposed by Martello et al. (2000) for the exact solution of the three-dimensional bin packing problem is given, showing that not all orthogonal packings can be generated by the proposed algorithm.
Abstract: In the three-dimensional bin packing problem the task is to orthogonally pack a given set of rectangular items into a minimum number of three-dimensional rectangular bins We give a characterization of the algorithm proposed by Martello et al (2000) for the exact solution of the problem, showing that not all orthogonal packings can be generated by the proposed algorithm The packings, however, have the property of being robot packings, which is relevant in practical settings References to the modified algorithm, which solves the orthogonal as well as robot packable three-dimensional problem, are given
44 citations
TL;DR: It is shown that, on the same types of instances, an exact algorithm proposed 10 years ago by the authors of the present note outperforms the new algorithm by some orders of magnitude.
26 citations
TL;DR: This special issue of European Journal of Operational Research is devoted to the ECCO XV Conference, the fifteen annual meeting of the European Chapter on Combinatorial Optimization, held at the University of Lugano (Switzerland), from May 30 to June 1, 2002.
8 citations
TL;DR: The ECCO meetings provide an excellent opportunity to discuss recent and important issues in combinatorial optimization and its applications and nicely combine scientific works and exchange of new ideas with an exciting atmosphere.
7 citations
01 Jan 2005
1 citations
Proceedings Article•
01 Jan 2005
TL;DR: In this article, a two-step linear programming approach based on constraint relaxation and coordination is proposed to solve the problem of the transition from hourly energy programs to refined energy programs, with the goal of minimizing the production costs.
Abstract: The paper aims at providing linear optimi- zation models useful for a generating company for the solution of the transition problem from hourly energy programs - provided by day-ahead market auctions - to feasible power generation dispatches and to refined energy programs, as may be requested by the system operator. The feasible power generation dispatches and the refined scheduling should comply with both the energy constraint, i.e. they should provide the same hourly-energy produc- tions defined by the day-ahead electricity market, and with all the power plant operating constraints. As some impor- tant power plant characteristics, such as ramp constraints, are not usually taken into account by the market auction mechanism, a feasible solution of the problem requires some additional efforts to be achieved. The paper de- scribes a two-steps linear programming approach, based on constraint relaxation and coordination, conceived with the aim of solving the above problem and with the goal to achieve a minimization of the production costs. The fea- tures and qualities of the implemented models are shown by case studies that refer to the present rules of the Italian electricity market.
1 citations