Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 222
Volume 222, Number 1, November 2014
- Justo Puerto, Antonio M. Rodríguez-Chía
, Arie Tamir:
An overview of ORP3-OR for young researchers and practitioners. 1-3 - Heiner Ackermann, Hendrik Ewe, Karl-Heinz Küfer, Michael Schröder:
Modeling profit sharing in combinatorial exchanges by network flows. 5-28 - Raha Akhavan-Tabatabaei, Manuel A. Bolívar, Jorge A. Hincapie, Andrés L. Medaglia:
On the optimal parking lot subscription policy problem: a hybrid simulation-optimization approach. 29-44 - M. Hakan Akyüz, I. Kuban Altinel, Temel Öncan:
Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem. 45-71 - Mohammed Alfaki, Dag Haugland:
A cost minimization heuristic for the pooling problem. 73-87 - Antonio Alonso-Ayuso, Laureano F. Escudero, Francisco Javier Martín-Campo:
On modeling the air traffic control coordination in the collision avoidance problem by mixed integer linear optimization. 89-105 - Jonas Baeklund:
Nurse rostering at a Danish ward. 107-123 - Mauro Maria Baldi, Teodor Gabriel Crainic, Guido Perboli, Roberto Tadei:
Branch-and-price and beam search algorithms for the Variable Cost and Size Bin Packing Problem with optional items. 125-141 - Dezso Bednay:
Stable sets in one-seller assignment games. 143-152 - Leonardo Berbotto, Sergio García, Francisco J. Nogales:
A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem. 153-173 - Rafael Blanquero, Emilio Carrizosa, Amaya Nogales-Gómez, Frank Plastria:
Single-facility huff location problems on networks. 175-195 - Radu Ioan Bot, André Heinrich:
Regression tasks in machine learning via Fenchel duality. 197-211 - Sonia Cafieri, Alberto Costa, Pierre Hansen:
Reformulation of a model for hierarchical divisive graph modularity maximization. 213-226 - Pelin G. Canbolat:
Optimal halting policies in Markov population decision chains with constant risk posture. 227-237 - Fabio Colombo, Marco Trubian:
A column generation approach for Multicast Routing and Wavelength Assignment with Delay Constraints in heterogeneous WDM networks. 239-260 - Maciej Drwal, Jerzy Józefczyk:
Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding. 261-277 - Amir Elalouf:
Fast approximation algorithms for routing problems with hop-wise constraints. 279-291 - Lanah Evers, Twan Dollevoet, Ana Isabel Barros, Herman Monsuur:
Robust UAV mission planning. 293-315 - Josep Freixas, Sascha Kurz:
Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum. 317-339 - Matthew P. Johnson, Alexander Gutfraind, Kiyan Ahmadizadeh:
Evader interdiction: algorithms, complexity and collateral damage. 341-359 - Yingying Kang, Rajan Batta, Changhyun Kwon:
Value-at-Risk model for hazardous material transportation. 361-387 - Javad Khazaei, Anthony Downward, Golbon Zakeri:
Modelling counter-intuitive effects on cost and air pollution from intermittent generation. 389-418 - W. Brian Lambert, Alexandra M. Newman:
Tailored Lagrangian Relaxation for the open pit block sequencing problem. 419-438 - Juan A. Mesa, Francisco A. Ortega, Miguel A. Pozo:
Locating optimal timetables and vehicle schedules in a transit line. 439-455 - Elke Moser, Andrea Seidl, Gustav Feichtinger:
History-dependence in production-pollution-trade-off models: a multi-stage approach. 457-481 - Andrea Raith, Judith Y. T. Wang, Matthias Ehrgott, Stuart A. Mitchell:
Solving multi-objective traffic assignment. 483-516 - Marcin Siepak, Jerzy Józefczyk:
Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion. 517-533 - Michael Stiglmayr, José Rui Figueira, Kathrin Klamroth:
On the multicriteria allocation problem. 535-549 - Xin Tang, Ameur Soukhal, Vincent T'kindt:
Preprocessing for a map sectorization problem by means of mathematical programming. 551-569
a service of 
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-04-22 20:56 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:
