Search results for "cutting stock problem"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Coromoto León, Gara Miranda, Casiano Rodríguez, Carlos Segura	A Distributed Parallel Algorithm to Solve the 2D Cutting Stock Problem.	PDP	2008	DBLP DOI BibTeX RDF	synchronization scheme, load balancing, cutting stock problem
3	Xianjun Shen, Yuanxiang Li, Jincai Yang, Li Yu	A Heuristic Particle Swarm Optimization for Cutting Stock Problem Based on Cutting Pattern.	International Conference on Computational Science	2007	DBLP DOI BibTeX RDF	Heuristic particle swarm optimization, One-dimensional cutting stock problem, Genetic operators
3	Laszlo Ladányi, Jon Lee, Robin Lougee-Heimer	Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem.	Annals OR	2005	DBLP DOI BibTeX RDF	branch-and-price methods, integer programming, open-source software, cutting stock problem
2	Jésica de Armas, Coromoto León, Gara Miranda	Fine and Coarse-grained Parallel Algorithms for the 2D Cutting Stock Problem.	PDP	2010	DBLP DOI BibTeX RDF	Parallel Algorithms, Cutting Stock Problem, Parallel Programming Tools
2	Ramiro Varela, Camino R. Vela, Jorge Puente, María R. Sierra, Inés González Rodríguez	An effective solution for a real cutting stock problem in manufacturing plastic rolls.	Annals OR	2009	DBLP DOI BibTeX RDF	Iterative sequential heuristics, Multi-objective optimization, Randomized algorithms, Meta-heuristics, Cutting stock
2	András Prékopa, Csaba I. Fábián	Cutting-Stock Problem.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Cutting pattern, Knapsack problem, Column generation, Cutting-stock problem
2	Bin Yang, Chunyang Li, Lan Huang, Ying Tan, Chunguang Zhou	Solving One-dimensional Cutting-Stock Problem Based on Ant Colony Optimization.	NCM	2009	DBLP DOI BibTeX RDF	one-dimensional cutting-stock problem, combinatorial optimization, ant colony optimization
2	Jésica de Armas, Coromoto León, Gara Miranda, Carlos Segura	Remote Service to Solve the Two-Dimensional Cutting Stock Problem: An Application to the Canary Islands Costume.	CISIS	2008	DBLP DOI BibTeX RDF
2	Coromoto León, Gara Miranda, Casiano Rodríguez, Carlos Segura	2D Cutting Stock Problem: A New Parallel Algorithm and Bounds.	Euro-Par	2007	DBLP DOI BibTeX RDF
2	Luis García, Coromoto León, Gara Miranda, Casiano Rodríguez	A Parallel Algorithm for the Two-Dimensional Cutting Stock Problem.	Euro-Par	2006	DBLP DOI BibTeX RDF
2	Luis García, Coromoto León, Gara Miranda, Casiano Rodríguez	Two-Dimensional Cutting Stock Problem: Shared Memory Parallelizations.	PARELEC	2006	DBLP DOI BibTeX RDF
2	Xianjun Shen, Yuanxiang Li, Bojin Zheng, Zhifeng Dai	General Particle Swarm Optimization Based on Simulated Annealing for Multi-specification One-Dimensional Cutting Stock Problem.	CIS	2006	DBLP DOI BibTeX RDF
2	Yaser M. A. Khalifa, O. Salem, A. Shahin	Cutting stock waste reduction using genetic algorithms.	GECCO	2006	DBLP DOI BibTeX RDF	waste reduction, genetic algorithms, cutting stock problem
2	Steven S. Seiden, Gerhard J. Woeginger	The two-dimensional cutting stock problem revisited.	Math. Program.	2005	DBLP DOI BibTeX RDF	Guillotine cuts, Approximation scheme, Worst case analysis, Strip packing, Cutting stock, Packing problem
2	Jinming Wan, Yadong Wu, Hongwei Dai	A Pattern Combination Based Approach to Two-Dimensional Cutting Stock Problem.	ICNC	2005	DBLP DOI BibTeX RDF
2	Hiroaki Chujo, Yuji Shono, Yoshitomo Ikkai, Norihisa Komoda	A rapid scheduling method with resource selection by flaw analysis for a rectangular cutting stock problem against flawed and connectable resources.	SMC	2004	DBLP DOI BibTeX RDF
2	J. Q. Jiang, Y. C. Liang, X. H. Shi, H. P. Lee	A Hybrid Algorithm Based on PSO and SA and Its Application for Two-Dimensional Non-guillotine Cutting Stock Problem.	International Conference on Computational Science	2004	DBLP DOI BibTeX RDF
2	Lisa D. Nicklas, Robert W. Atkins, Sanjeev Setia, Pearl Y. Wang	A Parallel Solution to the Cutting Stock Problem for a Cluster of Workstations. (PDF / PS)	HPDC	1996	DBLP DOI BibTeX RDF
2	D. A. Xerokostas, K. G. Aravossis	A Solution Procedure for Solving the Nonrectangular Cutting Stock Problem of the Clothing Industry Using Expert Knowledge within an Intelligent CAD Environment.	DEXA	1994	DBLP DOI BibTeX RDF
1	Fabio Furini, Enrico Malaguti, Rosa Medina Durán, Alfredo Persiani, Paolo Toth	A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size.	European Journal of Operational Research	2012	DBLP DOI BibTeX RDF
1	Omar Ayadi, Naoufel Cheikhrouhou, Faouzi Masmoudi	A new formulation of the two-dimensional cutting-stock problem with consideration of demand planning.	IJAOM	2012	DBLP DOI BibTeX RDF
1	Phan Thi Hoai Phuong	Hybridization of Genetic Algorithm and Branch-and-Price Framework for Solving the One Dimensional Cutting Stock Problem with Multiple Stock Sizes.	RIVF	2012	DBLP DOI BibTeX RDF
1	Yaodong Cui, Zhiyong Liu	C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction.	Optimization Methods and Software	2011	DBLP DOI BibTeX RDF
1	Julliany Sales Brandão, Alessandra Martins Coelho, João Flávio V. Vasconcellos, Luiz Leduíno de Salles Neto, André Vieira Pinto	Application of Genetic Algorithm to Minimize the Number of Objects Processed and Setup in a One-Dimensional Cutting Stock Problem.	IJAEC	2011	DBLP DOI BibTeX RDF
1	Jésica de Armas, Gara Miranda, Coromoto León	Two encoding schemes for a multi-objective Cutting Stock Problem.	IEEE Congress on Evolutionary Computation	2011	DBLP DOI BibTeX RDF
1	Jerzy W. Greblicki, Jerzy Kotowski, Ewa Szlachcic	The Cutting Stock Problem Recent Application in Information Technology.	EUROCAST	2011	DBLP DOI BibTeX RDF
1	Dawei Li, Shujin Qin, Yan Xiong, Li Wang	The Research and Realization of Algorithms for Guillotine Rectangle Cutting Stock Problem.	ICDMA	2011	DBLP DOI BibTeX RDF
1	Slimane Abou Msabah, Ahmed Riadh Baba-Ali	A new guillotine placement heuristic combined with an improved genetic algorithm for the orthogonal cutting-stock problem.	IEEM	2011	DBLP DOI BibTeX RDF
1	Jésica de Armas, Gara Miranda, Coromoto León	A Multi-objective Approach for the 2D Guillotine Cutting Stock Problem.	IWANN	2011	DBLP DOI BibTeX RDF
1	Yaodong Cui, Yuli Yang	A heuristic for the one-dimensional cutting stock problem with usable leftover.	European Journal of Operational Research	2010	DBLP DOI BibTeX RDF
1	Harald Reinertsen, Thomas W. M. Vossen	The one-dimensional cutting stock problem with due dates.	European Journal of Operational Research	2010	DBLP DOI BibTeX RDF
1	Douglas José Alem, Pedro Augusto Munari, Marcos Nereu Arenales, Paulo Augusto Valente Ferreira	On the cutting stock problem under stochastic demand.	Annals OR	2010	DBLP DOI BibTeX RDF
1	Celia A. Glass, Jeroen M. van Oostrum	Bun splitting: a practical cutting stock problem.	Annals OR	2010	DBLP DOI BibTeX RDF
1	Rita Macedo, Cláudio Alves, José M. Valério de Carvalho	Arc-flow model for the two-dimensional guillotine cutting stock problem.	Computers & OR	2010	DBLP DOI BibTeX RDF
1	Ahmed Mellouli, Faouzi Masmoudi, Imed Kacem, Mohamed Haddar	A Hybrid Genetic Algorithm for Optimization of Two-dimensional Cutting-Stock Problem.	Int. J. of Applied Metaheuristic Computing	2010	DBLP DOI BibTeX RDF
1	Klaus Jansen, Roberto Solis-Oba	An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths.	IPCO	2010	DBLP DOI BibTeX RDF
1	Tülin Aktin, Rifat Gürcan Özdemir	An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing.	European Journal of Operational Research	2009	DBLP DOI BibTeX RDF
1	Adriana Cristina Cherri, Marcos Nereu Arenales, Horacio Hideki Yanasse	The one-dimensional cutting stock problem with usable leftover - A heuristic approach.	European Journal of Operational Research	2009	DBLP DOI BibTeX RDF
1	Kelly Cristina Poldi, Marcos Nereu Arenales	Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths.	Computers & OR	2009	DBLP DOI BibTeX RDF
1	Yaodong Cui, Yiping Lu	Heuristic algorithm for a cutting stock problem in the steel bridge construction.	Computers & OR	2009	DBLP DOI BibTeX RDF
1	Claudio Arbib, Fabrizio Marinelli, Carlo M. Scoppola	A Lower Bound for the Cutting Stock Problem with a Limited Number of Open Stacks.	CTW	2009	DBLP BibTeX RDF
1	Josef Kallrath	Cutting circles and polygons from area-minimizing rectangles.	J. Global Optimization	2009	DBLP DOI BibTeX RDF	Non-overlap constraints, Global Optimization, Mixed integer programming, Assignment, Packing problem, Cutting stock problem, Shape constraints, Design problem
1	Freerk A. Lootsma	Optimization and Decision Support Systems.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Load dispatching, Linear programming, Multi-objective optimization, Integer programming, Mixed integer programming, Nonlinear programming, Group decision making, Energy modeling, Cutting-stock problem
1	Jésica de Armas, Coromoto León, Gara Miranda, Carlos Segura	Remote service to solve the two-dimensional cutting stock problem: an application to the Canary Islands costume.	IJWGS	2008	DBLP DOI BibTeX RDF
1	Cláudio Alves, José M. Valério de Carvalho	A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem.	Computers & OR	2008	DBLP DOI BibTeX RDF
1	Raymond Chiong, Yang Yaw Chang, Pui Chang Chai, Ai Leong Wong	A selective mutation based evolutionary programming for solving Cutting Stock Problem without contiguity.	IEEE Congress on Evolutionary Computation	2008	DBLP DOI BibTeX RDF
1	Alessandro Aloisio, Claudio Arbib, Fabrizio Marinelli	A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs.	CTW	2008	DBLP BibTeX RDF
1	Jon Lee	In situ column generation for a cutting-stock problem.	Computers & OR	2007	DBLP DOI BibTeX RDF
1	Raymond Chiong, Ooi Koon Beng	A Comparison between Genetic Algorithms and Evolutionary Programming based on Cutting Stock Problem.	Engineering Letters	2007	DBLP BibTeX RDF
1	Ramón Alvarez-Valdés, Rafael Martí, José Manuel Tamarit, Antonio Parajón	GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem.	INFORMS Journal on Computing	2007	DBLP DOI BibTeX RDF
1	César Muñoz, María R. Sierra, Jorge Puente, Camino R. Vela, Ramiro Varela	Improving Cutting-Stock Plans with Multi-objective Genetic Algorithms.	IWINAC	2007	DBLP DOI BibTeX RDF
1	Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki	One-Dimensional Cutting Stock Problem with a Given Number of Setups: A Hybrid Approach of Metaheuristics and Linear Programming.	J. Math. Model. Algorithms	2006	DBLP DOI BibTeX RDF
1	Adolf Diegel, Garth Miller, Edouard Montocchio, Sias van Schalkwyk, Olaf Diegel	Enforcing minimum run length in the cutting stock problem.	European Journal of Operational Research	2006	DBLP DOI BibTeX RDF
1	Hugo Terashima-Marín, Cláudia J. Farías Zárate, Peter Ross, Manuel Valenzuela-Rendón	A GA-based method to produce generalized hyper-heuristics for the 2D-regular cutting stock problem.	GECCO	2006	DBLP DOI BibTeX RDF	optimization, evolutionary computation, hyper-heuristics, cutting stock
1	Hugo Terashima-Marín, Cláudia J. Farías Zárate, Peter Ross, Manuel Valenzuela-Rendón	Two-Phase GA-Based Model to Learn Generalized Hyper-heuristics for the 2D-Cutting Stock Problem.	IBERAMIA-SBIA	2006	DBLP DOI BibTeX RDF
1	Raymond Chiong, Ooi Koon Beng	A Comparison between Genetic Algorithms and Evolutionary Programming based on Cutting Stock Problem.	IMECS	2006	DBLP BibTeX RDF
1	Gara Miranda-Valladares, Coromoto León	OpenMP Skeletons for Tree Searches.	PDP	2006	DBLP DOI BibTeX RDF
1	Miro Gradisar, Peter Trkman	A combined approach to the solution to the general one-dimensional cutting stock problem.	Computers & OR	2005	DBLP DOI BibTeX RDF
1	Nil Aras	Erratum to "The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon"[Computers and Operations Research 28 (2001) 271-287].	Computers & OR	2005	DBLP DOI BibTeX RDF
1	Yaodong Cui	A cutting stock problem and its solution in the manufacturing industry of large electric generators.	Computers & OR	2005	DBLP DOI BibTeX RDF
1	Gara Miranda-Valladares, Coromoto León	OpenMP Parallelizations of Viswanathan and Bagchi's Algorithm for the Two Dimensional Cutting Stock Problem.	PARCO	2005	DBLP BibTeX RDF
1	Kelly Poldi, Marcos N. Arenales, Andrea Vianna	Two-Dimensional Cutting Stock Problem Under Low Demand: a Study Case.	OR	2005	DBLP DOI BibTeX RDF
1	Gara Miranda-Valladares, Coromoto León	An OpenMP Skeleton for the A* Heuristic Search.	HPCC	2005	DBLP DOI BibTeX RDF
1	Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki	One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming.	Hybrid Metaheuristics	2004	DBLP BibTeX RDF
1	Darrell R. Ulm, Johnnie W. Baker, Michael C. Scherger	Solving a 2D Knapsack Problem Using a Hybrid Data-Parallel/Control Style of Computing.	IPDPS	2004	DBLP DOI BibTeX RDF
1	Mhand Hifi	Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock Problems.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	dynamic programming, heuristics, hill-climbing, depth-first search, knapsacking, cutting stock
1	Peter Trkman, Miro Gradisar	A Comparison Between Exact and Approximate Method for Solution of General One-Dimensional Cutting Stock Problem.	Informatica (Slovenia)	2003	DBLP BibTeX RDF
1	Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki	One-dimensional cutting stock problem to minimize the number of different patterns.	European Journal of Operational Research	2003	DBLP DOI BibTeX RDF
1	Michael Armbruster	A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry.	European Journal of Operational Research	2002	DBLP DOI BibTeX RDF
1	Oliver Holthaus	Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths.	European Journal of Operational Research	2002	DBLP DOI BibTeX RDF
1	Gleb Belov, Guntram Scheithauer	A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths.	European Journal of Operational Research	2002	DBLP DOI BibTeX RDF
1	Eugene J. Zak	Row and column generation technique for a multistage cutting stock problem.	Computers & OR	2002	DBLP DOI BibTeX RDF
1	Víctor Parada, Lorena Pradenas, Mauricio Solar, Rodrigo Palma	A Hybrid Algorithm for the Non-Guillotine Cutting Problem.	Annals OR	2002	DBLP DOI BibTeX RDF	trim loss, heuristic methods, cutting stock
1	Julia A. Bennell, Kathryn A. Dowsland, William B. Dowsland	The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon.	Computers & OR	2001	DBLP DOI BibTeX RDF
1	Claire Kenyon, Eric Rémila	A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem.	Math. Oper. Res.	2000	DBLP DOI BibTeX RDF
1	Christoph Nitsche, Guntram Scheithauer, Johannes Terno	Tighter relaxations for the cutting stock problem.	European Journal of Operational Research	1999	DBLP DOI BibTeX RDF
1	Julien Antonio, Fabrice Chauvet, Chengbin Chu, Jean-Marie Proth	The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming.	European Journal of Operational Research	1999	DBLP DOI BibTeX RDF
1	Loris Faina	An application of simulated annealing to the cutting stock problem.	European Journal of Operational Research	1999	DBLP DOI BibTeX RDF
1	Parimal Kopardekar, Anil Mital	Cutting stock problem: a heuristic solution based on operators' intuitive strategies.	Int. J. Computer Integrated Manufacturing	1999	DBLP DOI BibTeX RDF
1	Lisa D. Nicklas, Robert W. Atkins, Sanjeev Setia, Pearl Y. Wang	Design and implementation of a parallel solution to the cutting stock problem.	Concurrency - Practice and Experience	1998	DBLP DOI BibTeX RDF
1	Reinaldo Morabito, Valdir Garcia	The cutting stock problem in a hardboard industry: a case study.	Computers & OR	1998	DBLP DOI BibTeX RDF
1	Eva Onaindia, Federico Barber, Vicente J. Botti, Carlos Carrascosa, Miguel A. Hernandez, Miguel Rebollo	A Progressive Heuristic Search Algorithm for the Cutting Stock Problem.	IEA/AIE (Vol. 2)	1998	DBLP DOI BibTeX RDF
1	Spiridon A. Kazarlis, Vassilios Petridis	Varying Fitness Functions in Genetic Algorithms: Studying the Rate of Increase of the Dynamic Penalty Terms.	PPSN	1998	DBLP DOI BibTeX RDF
1	Claire Kenyon, Eric Rémila	Approximate Strip Packing.	FOCS	1996	DBLP DOI BibTeX RDF	packing rectangles, NP-hard cutting-stock problem, fractional bin-packing, guillotine cuts, computational complexity, strip-packing
1	Stefan Tschöke, Norbert Holthöfer	A New Parallel Approach to the Constrained Two-Dimensional Cutting Stock Problem.	IRREGULAR	1995	DBLP DOI BibTeX RDF
1	Jörg Heistermann, Thomas Lengauer	Efficient Automatic Part Nesting on Irregular and Inhomogeneous Surfaces.	SODA	1993	DBLP DOI BibTeX RDF	nesting problem, trim-loss problem, two-dimensional placement, combinatorial algorithms, greedy method, cutting-stock problem
1	Parviz Ghandforoush, John J. Daniels	A Heuristic Algorithm for the Guillotine Constrained Cutting Stock Problem.	INFORMS Journal on Computing	1992	DBLP DOI BibTeX RDF
1	Mehmet Dincbas, Helmut Simonis, Pascal Van Hentenryck	Solving a Cutting-Stock Problem in Constraint Logic Programming.	ICLP/SLP	1988	DBLP BibTeX RDF
1	Antonio Albano, Renzo Orsini	A Heuristic Solution of the Rectangular Cutting Stock Problem.	Comput. J.	1980	DBLP DOI BibTeX RDF
1	Michael Adamowicz, Antonio Albano	A Two-stage Solution of the Cutting-stock Problem.	IFIP Congress	1971	DBLP BibTeX RDF