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 17
Volume 17, Number 1, March 2019
- Pietro De Giovanni
, Georges Zaccour:
A selective survey of game-theoretic models of closed-loop supply chains. 1-44 - Mehmet Güray Güler:
Advertising and forecasting investments of a newsvendor. 45-73 - Luciano Porretta, Daniele Catanzaro, Bjarni V. Halldórsson, Bernard Fortz:
A Branch & Price algorithm for the minimum cost clique cover problem in max-point tolerance graphs. 75-96 - Johnny C. Ho, Ivar Massabò, Giuseppe Paletta, Alex J. Ruiz-Torres:
A note on posterior tight worst-case bounds for longest processing time schedules. 97-107 - Stef Moons:
Integrating order picking and vehicle routing decisions. 109-110 - Jeroen Corstjens:
A methodological framework for evaluating metaheuristics: an application to vehicle routing. 111-112 - Acknowledgement to referees. 113-114
Volume 17, Number 2, June 2019
- Clarisse Dhaenens, Laetitia Jourdan:
Metaheuristics for data mining - Survey and opportunities for big data. 115-139 - Ramón Flores, Elisenda Molina, Juan Tejada:
Evaluating groups with the generalized Shapley value. 141-172 - John Martinovic, Markus Hähnel, Guntram Scheithauer, Waltenegus Dargie, Andreas Fischer:
Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation. 173-200 - Ren-Xia Chen, Shi-Sheng Li:
Two-agent single-machine scheduling with cumulative deterioration. 201-219 - Elisabeth Rodríguez-Heck:
Linear and quadratic reformulations of nonlinear optimization problems in binary variables. 221-222 - Stef Lemmens:
The trade-off between inventories, lead time and capacity: application to vaccine supply chain design. 223-224
Volume 17, Number 3, September 2019
- Simon Bull, Jesper Larsen, Richard Martin Lusby, Natalia J. Rezanova:
Optimising the travel time of a line plan. 225-259 - Salim Haddadi:
Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem. 261-295 - Mariusz Górajski, Dominika Machowska:
How do loyalty programs affect goodwill? An optimal control approach. 297-316 - Zohre Aminifard, Saman Babaie-Kafaki:
An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix. 317-330 - Teun van Gils:
Designing efficient order picking systems: combining planning problems and integrating real-life features. 331-332 - Stefano Michelini:
A comparative study of labeling algorithms within the branch-and-price framework for vehicle routing with time windows. 333-334
Volume 17, Number 4, December 2019
- Fred W. Glover, Gary A. Kochenberger, Yu Du:
Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models. 335-371 - Amir Ahamdi-Javid, Nasrin Ramshe:
Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm. 373-400 - Sergio Consoli, Jan H. M. Korst, Gijs Geleijnse, Steffen Pauws:
An exact algorithm for the minimum quartet tree cost problem. 401-425 - Xin Guo, Qiuli Liu, Yi Zhang:
Finite horizon risk-sensitive continuous-time Markov decision processes with unbounded transition and cost rates. 427-442 - Andrea Mor:
Consolidation and coordination of routes in urban distribution. 443 - Mlouka Farhat:
Batch replenishment planning under capacity reservation contract. 445-446 - Christine Tawfik:
Tactical planning on freight transport networks: service design and pricing. 447-448 - Acknowledgement to referees. 449-450
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-10-25 20:02 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:
