Sciweavers

3352 search results - page 234 / 671
» Hierarchical Problem Solving and the Bayesian Optimization A...
Sort
View
EOR
2002
74views more  EOR 2002»
15 years 6 months ago
Modeling multistage cutting stock problems
In multistage cutting stock problems (CSP) the cutting process is distributed over several successive stages. Every stage except the last one produces intermediate products. The l...
Eugene J. Zak
TIP
2010
163views more  TIP 2010»
15 years 1 months ago
Fast Image Recovery Using Variable Splitting and Constrained Optimization
We propose a new fast algorithm for solving one of the standard formulations of image restoration and reconstruction which consists of an unconstrained optimization problem where t...
Manya V. Afonso, José M. Bioucas-Dias, M&aa...
EVOW
2007
Springer
16 years 24 days ago
A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
Christian Blum, Carlos Cotta, Antonio J. Fern&aacu...
EVOW
2001
Springer
15 years 11 months ago
Automated Solution of a Highly Constrained School Timetabling Problem - Preliminary Results
This work introduces a highly constrained school timetabling problem which was modeled from the requirements of a German high school. The concept for solving the problem uses a hyb...
Marc Bufé, Tim Fischer, Holger Gubbels, Cla...
NCA
2008
IEEE
15 years 6 months ago
Neurodynamic programming: a case study of the traveling salesman problem
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
Jia Ma, Tao Yang, Zeng-Guang Hou, Min Tan, Derong ...