Marcos Nereu Arenales

According to our database1, Marcos Nereu Arenales authored at least 20 papers between 2000 and 2014.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
The one-dimensional cutting stock problem with usable leftovers - A survey.
Eur. J. Oper. Res., 2014

Determining the K-best solutions of knapsack problems.
Comput. Oper. Res., 2014

2013
The usable leftover one-dimensional cutting stock problem - a priority-in-use heuristic.
Int. Trans. Oper. Res., 2013

2011
A linear optimization approach to the combined production planning model.
J. Frankl. Inst., 2011

The constrained compartmentalized knapsack problem: mathematical models and solution methods.
Eur. J. Oper. Res., 2011

Crop rotation scheduling with adjacency constraints.
Ann. Oper. Res., 2011

2010
Sustainable vegetable crop supply problem.
Eur. J. Oper. Res., 2010

On the cutting stock problem under stochastic demand.
Ann. Oper. Res., 2010

2009
Special issue on cutting, packing and related problems.
Int. Trans. Oper. Res., 2009

The one-dimensional cutting stock problem with usable leftover - A heuristic approach.
Eur. J. Oper. Res., 2009

Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths.
Comput. Oper. Res., 2009

2008
Lot sizing and furnace scheduling in small foundries.
Comput. Oper. Res., 2008

A coupling cutting stock-lot sizing problem in the paper industry.
Ann. Oper. Res., 2008

2007
Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups.
J. Heuristics, 2007

The one dimensional Compartmentalised Knapsack Problem: A case study.
Eur. J. Oper. Res., 2007

An adaptation of the dual-affine interior point method for the surface flatness problem.
Eur. J. Oper. Res., 2007

The constrained compartmentalised knapsack problem.
Comput. Oper. Res., 2007

2005
Two-Dimensional Cutting Stock Problem Under Low Demand: a Study Case.
Proceedings of the Operations Research Proceedings 2005, 2005

2002
A lot-sizing problem in an automated foundry.
Eur. J. Oper. Res., 2002

2000
Piecewise linear programming via interior points.
Comput. Oper. Res., 2000


  Loading...