Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Laszlo Ladanyi"'
Publikováno v:
INFORMS Journal on Computing. 21:383-397
In this paper, we discuss the challenges that arise in parallelizing algorithms for solving generic mixed integer linear programs and introduce a software framework that aims to address these challenges. Although the framework makes few algorithmic a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33e738e608894ca7aab245c647646f95
https://doi.org/10.1287/ijoc.1090.0347
https://doi.org/10.1287/ijoc.1090.0347
Autor:
Francisco Barahona, Maxim Sviridenko, Pawan Chowdhary, Grzegorz Swirszcz, Tracy Kimbrel, Laszlo Ladanyi, Karthik Sourirajan, Baruch Schieber, Markus Ettl, Paul Huang, Young M. Lee
Publikováno v:
IBM Journal of Research and Development. 51:391-407
This paper describes a prototype inventory-placement and transportation-scheduling solution developed in support of the emerging military doctrine of Network-Centric Operations (NCO). NCO refers to an unprecedented ability to share information among
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a4375417188fb3b07b5474e3868cad2
https://doi.org/10.1147/rd.513.0391
https://doi.org/10.1147/rd.513.0391
Publikováno v:
Transportation Science. 40:313-326
We present the optimization component of a decision support system developed for a sedan service provider. The system assists supervisors and dispatchers in scheduling driver shifts and routing the fleet throughout the day to satisfy customer demands
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c126712216f7eec39dbda3053f2b681d
https://doi.org/10.1287/trsc.1050.0122
https://doi.org/10.1287/trsc.1050.0122
Publikováno v:
INFORMS Journal on Computing. 18:129-134
In this paper, we study a new problem that we refer to as the multiple knapsack with color constraints (MKCP). Motivated by a real application from the steel industry, the MKCP can be formulated by generalizing the multiple knapsack problem. A real-l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::466541117c72557ade00ac6793bafc99
https://doi.org/10.1287/ijoc.1040.0078
https://doi.org/10.1287/ijoc.1040.0078
Autor:
Laszlo Ladanyi, Francisco Barahona
Publikováno v:
RAIRO - Operations Research. 40:53-73
We present a Branch-and-Cut algorithm where the volume algorithm is applied instead of the traditionally used dual simplex algorithm to the linear programming relaxations in the root node of the search tree. This means that we use fast approximate so
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d09e3dcd4f565b85c9a6ff3ac1478ff
https://doi.org/10.1051/ro:2006010
https://doi.org/10.1051/ro:2006010
Publikováno v:
Annals of Operations Research. 139:243-265
The rate at which research ideas can be prototyped is significantly increased when re-useable software components are employed. A mission of the Computational Infrastructure for Operations Research (COIN-OR) initiative is to promote the development a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d071ed21144efd17d12115bbfb670981
https://doi.org/10.1007/s10479-005-3450-1
https://doi.org/10.1007/s10479-005-3450-1
Publikováno v:
Management Science. 51:391-406
When combinatorial bidding is permitted in auctions, such as the proposed FCC Auction #31, the resulting full valuations and winner-determination problem can be computationally challenging. We present a branch-and-price algorithm based on a set-packi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::57fcc6b3795ef0168115e401f055e448
https://doi.org/10.1287/mnsc.1040.0332
https://doi.org/10.1287/mnsc.1040.0332
Publikováno v:
Journal of Heuristics. 11:147-173
Consider a marketplace operated by a buyer who wishes to procure large quantities of several heterogeneous products. Suppliers submit price curves for each of the commodities indicating the price charged as a function of the supplied quantity. The to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0cac6afd2e7ff5a93dccb8ecce7e9c81
https://doi.org/10.1007/s10732-005-0389-y
https://doi.org/10.1007/s10732-005-0389-y
Publikováno v:
The Journal of Supercomputing. 28:215-234
This paper describes the design of the Abstract Library for Parallel Search (ALPS), a framework for implementing scalable, parallel algorithms based on tree search. ALPS is specifically designed to support data-intensive algorithms, in which large am
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e11156a41f7a328486ad3556dd09a12
https://doi.org/10.1023/b:supe.0000020179.55383.ad
https://doi.org/10.1023/b:supe.0000020179.55383.ad
Publikováno v:
Mathematical Programming. 98:253-280
In discrete optimization, most exact solution approaches are based on branch and bound, which is conceptually easy to parallelize in its simplest forms. More sophisticated variants, such as the so-called branch, cut, and price algorithms, are more di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8246579a14c9eb70f1b7860d7c83c6c8
https://doi.org/10.1007/s10107-003-0404-8
https://doi.org/10.1007/s10107-003-0404-8