default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 101
Volume 101, January 2019
- Grit Ecker, Di Yuan, Arie M. C. A. Koster
, Anke Schmeink:
Accurate optimization models for interference constrained bandwidth allocation in cellular networks. 1-12 - Shengsheng Niu, Shiji Song, Jianya Ding, Yuli Zhang, Raymond Chiong:
Distributionally robust single machine scheduling with the total tardiness criterion. 13-28 - Daniele Manerba, Guido Perboli:
New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty. 29-42 - Golbarg K. Tutunchi, Yahya Fathi:
Effective methods for solving the Bi-criteria p-Center and p-Dispersion problem. 43-54 - Tong Wang, Ricardo M. Lima, Loïc Giraldi, Omar M. Knio:
Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming. 55-75 - Jaime Cano-Belmán, Herbert Meyr:
Deterministic allocation models for multi-period demand fulfillment in multi-stage customer hierarchies. 76-92 - Hyun-Jung Kim, Jun-Ho Lee:
Three-machine flow shop scheduling with overlapping waiting time constraints. 93-102 - Christian Gahm, John J. Kanet, Axel Tuma:
On the flexibility of a decision theory-based heuristic for single machine scheduling. 103-115 - Yu Wang, Feng Chen:
Packed parts delivery problem of automotive inbound logistics with a supplier park. 116-129 - Bayan Hamdan, Ali Diabat:
A two-stage multi-echelon stochastic blood supply chain problem. 130-143 - Mick Van Den Eeckhout, Broos Maenhout, Mario Vanhoucke:
A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints. 144-161 - Lei Xu, Xiaoran Shi, Peng Du, Kannan Govindan, Zhenchao Zhang:
Optimization on pricing and overconfidence problem in a duopolistic supply chain. 162-172 - Luis Fanjul-Peyro, Rubén Ruiz, Federico Perea:
Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times. 173-182 - Giusy Macrina, Luigi Di Puglia Pugliese, Francesca Guerriero, Gilbert Laporte:
The green mixed fleet vehicle routing problem with partial battery recharging and time windows. 183-199 - Xingyin Wang, Bruce L. Golden, Edward A. Wasil:
A Steiner Zone Variable Neighborhood Search Heuristic for the Close-Enough Traveling Salesman Problem. 200-219 - Thiago André Guimarães, Leandro C. Coelho, Cleder M. Schenekemberg, Cassius Tadeu Scarpin:
The two-echelon multi-depot inventory-routing problem. 220-233 - José Fernández, Boglárka G.-Tóth, Juana López Redondo, Pilar M. Ortigosa:
The probabilistic customer's choice rule with a threshold attraction value: Effect on the location of competitive facilities in the plane. 234-249 - Ran Liu, Yangyi Tao, Xiaolei Xie:
An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits. 250-262 - Payman Ghasemi Saghand, Hadi Charkhgard, Changhyun Kwon:
A Branch-and-Bound Algorithm for a Class of Mixed Integer Linear Maximum Multiplicative Programs: A Bi-objective Optimization Approach. 263-274 - Francesco Carrabs, Raffaele Cerulli, Giovanni Felici, Gaurav Singh:
Exact approaches for the orderly colored longest path problem: Performance comparison. 275-284 - Yongliang Lu, Una Benlic, Qinghua Wu:
A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem. 285-297
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 2025-10-22 02:18 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:
