default search action
4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies, Volume 18
Volume 18, Number 1, March 2020
- Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico:
Essentials of numerical nonsmooth optimization. 1-47 - Maria Teresa Alonso, Ramón Alvarez-Valdés, Francisco Parreño:
A GRASP algorithm for multi container loading problems with practical constraints. 49-72 - N. Mahdavi-Amiri, M. Shaeiri:
A conjugate gradient sampling method for nonsmooth optimization. 73-90 - Bo Yan, Jiwen Wu, Zijie Jin, Shiyou He:
Decision-making of fresh agricultural product supply chain considering the manufacturer's fairness concerns. 91-122 - Arthur Kramer:
Exact and heuristic algorithms for scheduling problems. 123-124 - Davide Duma:
Online optimization methods applied to the management of health services. 125-126 - Hilde Heggen:
Optimising load planning and container routing in intermodal rail transport. 127-128
Volume 18, Number 2, June 2020
- Andrea Mor, Maria Grazia Speranza:
Vehicle routing problems over time: a survey. 129-149 - Xide Zhu, Peijun Guo:
Bilevel programming approaches to production planning for multiple products with short life cycles. 151-175 - Rubing Chen, Jinjiang Yuan:
Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices. 177-196 - Lars Schewe, Martin Schmidt, Johannes Thürauf:
Structural properties of feasible bookings in the European entry-exit gas market system. 197-218 - Sanaz Bojari, M. R. Eslahchi:
Global convergence of a family of modified BFGS methods under a modified weak-Wolfe-Powell line search for nonconvex functions. 219-244 - Edoardo Fadda:
Integrating sensors data in optimization methods for sustainable urban logistic. 245-246 - Mariangela Rosano:
Mixing quantitative and qualitative methods for sustainable transportation in smart cities. 247-248
Volume 18, Number 3, September 2020
- Dan Bienstock, Mauro Escobar, Claudio Gentile, Leo Liberti:
Mathematical programming formulations for the alternating current optimal power flow problem. 249-292 - Jéssica Gabriela de Almeida Cunha, Vinícius Loti de Lima, Thiago Alves de Queiroz:
Grids for cutting and packing problems: a study in the 2D knapsack problem. 293-339 - Martijn van Ee, René Sitters:
The Chinese deliveryman problem. 341-356 - Emilio Carrizosa, Alba V. Olivares-Nadal, Pepa Ramírez-Cobo:
Embedding the production policy in location-allocation decisions. 357-380 - Arno De Caigny:
Innovation in customer scoring for the financial services industry. 381-382 - Katyanne Farias de Araújo:
Inventory routing problems on two-echelon systems: exact and heuristic methods for the tactical and operational problems. 383-384 - Amir Ahmadi-Javid, Nasrin Ramshe:
Correction to: Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm. 385
Volume 18, Number 4, December 2020
- Fred W. Glover, Gary A. Kochenberger, Moses Ma, Yu Du:
Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange. 387-417 - Guilan Yan, Yi He:
Coordinating pricing and advertising in a two-period fashion supply chain. 419-438 - Gur Mosheiov, Assaf Sarig, Vitaly A. Strusevich:
Minmax scheduling and due-window assignment with position-dependent processing times and job rejection. 439-456 - Juan Carlos Gonçalves-Dosantos, Ignacio García-Jurado, Julián Costa-Bouzas:
Sharing delay costs in stochastic scheduling problems with delays. 457-476 - Hadi Charkhgard, Mahdi Takalloo, Zulqarnain Haider:
Bi-objective autonomous vehicle repositioning problem with travel time uncertainty. 477-505 - Dhananjay R. Thiruvady, Rhyd Lewis, Kerri Morgan:
Tackling the maximum happy vertices problem in large networks. 507-527 - Hendrik Vermuyten:
Design of integrated scheduling and simulation models to optimise people flows and maximise safety. 529-530 - Acknowledgement to referees. 531-532
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.