default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 63
Volume 63, November 2015
- Changmuk Kang, Byung-Cheon Choi
:
An adaptive crashing policy for stochastic time-cost tradeoff problems. 1-6 - Xiangyong Kong, Liqun Gao, Haibin Ouyang, Steven Li:
Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm. 7-22 - Shadi Sharif Azadeh, Patrice Marcotte, Gilles Savard:
A non-parametric approach to demand forecasting in revenue management. 23-31 - Michael H. Veatch:
Approximate linear programming for networks: Average cost bounds. 32-45 - Kevin R. Gue, Hyun Ho Kim:
An approximation model for sojourn time distributions in acyclic multi-server queueing networks. 46-55 - Luis Eduardo Neves Gouveia, Mario Ruthmair:
Load-dependent and precedence-based models for pickup and delivery problems. 56-71 - Jing Xiao, Huasheng Yang, Canrong Zhang, Li Zheng, Jatinder N. D. Gupta:
A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times. 72-82 - Manuel Iori, Jorge Riera-Ledesma:
Exact algorithms for the double vehicle routing problem with multiple stacks. 83-101 - Kate Smith-Miles, Simon Bowly:
Generating new test instances by evolving in instance space. 102-113 - Mehmet Ergezer, Dan Simon:
Probabilistic properties of fitness-based quasi-reflection in evolutionary algorithms. 114-124 - Marta Cabo, Edgar Possani, Chris N. Potts, Xiang Song:
Split-merge: Using exponential neighborhood search for scheduling a batching machine. 125-135 - Diego Jacinto Fiorotto, Silvio Alexandre de Araujo, Raf Jans:
Hybrid methods for lot sizing on parallel machines. 136-148 - Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha:
Lower bounds and exact algorithms for the quadratic minimum spanning tree problem. 149-160 - Silvano Martello, Michele Monaci:
Models and algorithms for packing rectangles into the smallest square. 161-171 - Daniel Vaz, Luís Paquete, Carlos M. Fonseca, Kathrin Klamroth, Michael Stiglmayr:
Representation of the non-dominated set in biobjective discrete optimization. 172-186
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-24 02:51 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:
