default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies, Volume 10
Volume 10, Number 1, March 2012
- Leo Liberti
, Thierry Marchant, Silvano Martello:
No end of the world in 2012 for 4OR. 1-13 - Youssef Hamadi, Saïd Jabbour, Lakhdar Sais:
Learning from conflicts in propositional satisfiability. 15-32 - Takashi Matsuhisa:
A characterisation of stable sets in preordered structure. 33-41 - Ruibin Bai, Jacek Blazewicz, Edmund K. Burke, Graham Kendall, Barry McCollum:
A simulated annealing hyper-heuristic methodology for flexible decision support. 43-66 - Sofian De Clercq, Bart Steyaert, Herwig Bruneel:
Delay analysis of a discrete-time multiclass slot-bound priority system. 67-79 - Mireille Jacomino, Minh-Hoang Le:
Robust energy planning in buildings with energy and comfort costs. 81-103 - Oumar Koné:
New approaches for solving the resource-constrained project scheduling problem. 105-106 - Fabrice Talla Nobibon:
Algorithms for selection and graph-coloring problems with applications in marketing and micro-economics. 107-108 - Salvatore Cannella:
The impact of collaboration and smoothing replenishment rules on supply chain performance. 109-110
Volume 10, Number 2, June 2012
- Hans Kellerer, Vitaly A. Strusevich:
The symmetric quadratic knapsack problem: approximation and scheduling applications. 111-161 - Rosella Castellano, Rosella Giacometti:
Credit default swaps: implied ratings versus official ones. 163-180 - Alexandre Dolgui, Sergey Kovalev:
Min-max and min-max (relative) regret approaches to representatives selection problem. 181-192 - Yerim Chung, Marc Demange:
On inverse traveling salesman problems. 193-209 - Fabio D'Andreagiovanni:
Pure 0-1 programming approaches to wireless network design. 211-212 - Fabio Salassa:
Matheuristics for combinatorial optimization problems: applications to services and production systems. 213-214 - Michael Poss:
Models and algorithms for network design problems. 215-216 - Franco Mascia:
Analysis of reactive search optimisation techniques for the maximum clique problem and applications. 217-218 - Fabio Furini:
Decomposition and reformulation of integer linear programming problems. 219-220
Volume 10, Number 3, September 2012
- Alberto Del Pia, Robert Weismantel:
Relaxations of mixed integer sets from lattice-free polyhedra. 221-244 - Ángel Felipe, M. Teresa Ortuño, Gregorio Tirado:
An adapted heuristic approach for a clustered traveling salesman problem with loading constraints. 245-265 - Francisco J. Arcelus, Satyendra Kumar, Gopalan Srinivasan:
Bicriteria optimization in the newsvendor problem with uniformly distributed demand. 267-286 - Wei Sun, Yulan Wang, Naishuo Tian:
Pricing and setup/closedown policies in unobservable queues with strategic customers. 287-311 - Rina Mary Mazza:
Simulation-based optimization in port logistics. 313-314 - Federico Liberatore:
Protection planning for critical infrastructure systems in location analysis: models and algorithms. 315-316 - Juan G. Villegas:
Vehicle routing problems with trailers. 317-318 - Sergio Consoli:
The development and application of metaheuristics for problems in graph theory: a computational study. 319-320
Volume 10, Number 4, December 2012
- Franz Rendl:
Semidefinite relaxations for partitioning, assignment and ordering problems. 321-346 - Adam Janiak, Wladyslaw A. Janiak, Mikhail Y. Kovalyov, Frank Werner:
Soft due window assignment and scheduling of unit-time jobs on parallel machines. 347-360 - Lucio Bianco, Massimiliano Caramia:
Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm. 361-377 - Julien Roland, Yves De Smet, José Rui Figueira:
On the calculation of stability radius for multi-objective combinatorial optimization problems by inverse optimization. 379-389 - Simona Mancini:
The two-echelon vehicle routing problem. 391-392 - Daniel Cosmin Porumbel:
Heuristic algorithms and learning techniques: applications to the graph coloring problem. 393-394 - Luigi Di Puglia Pugliese:
Models and methods for the constrained shortest path problem and its variants. 395-396 - Arnaud Malapert:
Shop and batch scheduling with constraints. 397-398
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-19 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
