Sciweavers

9810 search results - page 238 / 1962
» Problems, Descriptions and Objects
Sort
View
CSR
2010
Springer
15 years 10 months ago
Frameworks for Logically Classifying Polynomial-Time Optimisation Problems
We show that a logical framework, based around a fragment of existential second-order logic formerly proposed by others so as to capture the class of polynomially-bounded P-optimi...
James Gate, Iain A. Stewart
EOR
2010
96views more  EOR 2010»
15 years 5 months ago
The hybrid flow shop scheduling problem
The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many r...
Rubén Ruiz, José Antonio Vázq...
132
Voted
EOR
2007
80views more  EOR 2007»
15 years 5 months ago
Coherent risk measures in inventory problems
We analyze an extension of the classical multi-period, single-item, linear cost inventory problem where the objective function is a coherent risk measure. Properties of coherent r...
Shabbir Ahmed, Ulas Çakmak, Alexander Shapi...
ANOR
2011
214views more  ANOR 2011»
15 years 25 days ago
A hybrid constraint programming approach to the log-truck scheduling problem
Abstract. Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization te...
Nizar El Hachemi, Michel Gendreau, Louis-Martin Ro...
APAL
2011
15 years 25 days ago
The provably total NP search problems of weak second order bounded arithmetic
We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...
Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Ne...