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 12
Volume 12, Number 1, March 2014
- Massimo Pappalardo, Giandomenico Mastroeni
, Mauro Passacantando:
Merit functions: a bridge between optimization and equilibria. 1-33 - Jacek Blazewicz, Pascal Bouvry, Mikhail Y. Kovalyov, Jedrzej Musial:
Internet shopping with price sensitive discounts. 35-48 - Alexey B. Piunovskiy, Yi Zhang:
Discounted continuous-time Markov decision processes with unbounded rates and randomized history-dependent policies: the dynamic programming approach. 49-75 - Frank Plastria, Emilio Carrizosa:
Linear separation and approximation by minimizing the sum of concave functions of distances. 77-85 - Cheng He, Hao Lin, Xiumei Wang:
Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost. 87-93 - José Carlos Díaz Díaz:
Exact and heuristic solutions for combinatorial optimization problems. 95-96 - Thibaut Vidal:
General solution approaches for multi-attribute vehicle routing and scheduling problems. 97-98 - John Willmer Escobar:
Heuristic algorithms for the capacitated location-routing problem and the multi-depot vehicle routing problem. 99-100
Volume 12, Number 2, June 2014
- Philippe Chrétienne:
On scheduling with the non-idling constraint. 101-121 - Pasquale Legato, Roberto Trunfio:
A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules. 123-156 - Daiki Min:
Heuristic procedures for a stochastic batch service problem. 157-174 - Nadjib Brahimi, Sharfuddin Ahmed Khan:
Warehouse location with production, inventory, and distribution decisions: a case study in the lube oil industry. 175-197 - Fabio Roda:
Integrating high-level requirements in optimization problems: theory and applications. 199-200
Volume 12, Number 3, September 2014
- Giuseppe Lancia, Paolo Serafini:
Deriving compact extended formulations via LP-based separation techniques. 201-234 - Florent Hernández, Dominique Feillet, Rodolphe Giroudeau, Olivier Naud:
A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration. 235-259 - Abdelkader Merakeb, Frédéric Messine, Mohamed Aidène:
A Branch and Bound algorithm for minimizing the energy consumption of an electrical vehicle. 261-283 - Saman Babaie-Kafaki:
On the sufficient descent condition of the Hager-Zhang conjugate gradient methods. 285-292 - Mauro Maria Baldi:
Generalized Bin Packing Problems. 293-294 - Xin Tang:
A multicriteria sectorization problem in cartography. 295-296 - Ghassen Tlig:
Reconstructing binary and colored matrices in discrete tomography. 297-298 - William J. Guerrero:
Hybrid heuristics for the inventory-location-routing problem. 299-300
Volume 12, Number 4, December 2014
- Satyajith Amaran, Nikolaos V. Sahinidis, Bikram Sharda, Scott J. Bury:
Simulation optimization: a review of algorithms and applications. 301-333 - Syed Asif Raza:
A distribution free approach to newsvendor problem with pricing. 335-358 - Nathalie Bostel, Philippe Castagliola, Pierre Dejax, André Langevin:
Approximating the length of Chinese postman tours. 359-372 - Taehan Lee, Changhyun Kwon:
A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty. 373-378 - Timothy P. Chartier, Victoria Ellison, Amy Nicole Langville:
A Davidson College multi-objective assignment problem: a case study. 379-401 - Jacek Blazewicz, Pascal Bouvry, Mikhail Y. Kovalyov, Jedrzej Musial:
Erratum to: Internet shopping with price-sensitive discounts. 403-406 - Acknowledgement to referees. 407-409
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 2026-05-15 23:31 CEST 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:
