Laszlo Ladányi
Y. Xu
Ted K. Ralphs
Laszlo Ladányi
Matthew J. Saltzman
Computational Experience with a Software Framework for Parallel Integer Programming.
383-397
2009
21
INFORMS J. Comput.
3
https://doi.org/10.1287/ijoc.1090.0347
db/journals/informs/informs21.html#XuRLS09
Francisco Barahona
Pawan Chowdhary
Markus Ettl
Pu Huang
Tracy Kimbrel
Laszlo Ladányi
Young M. Lee
Baruch Schieber
Karthik Sourirajan
Maxim Sviridenko
Grzegorz Swirszcz
Inventory allocation and transportation scheduling for logistics of network-centric military operations.
391-408
2007
51
IBM J. Res. Dev.
3/4
https://doi.org/10.1147/rd.513.0391
db/journals/ibmrd/ibmrd51.html#BarahonaCEHKLLSSSS07
John J. H. Forrest
Jayant Kalagnanam
Laszlo Ladányi
A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints.
129-134
2006
18
INFORMS J. Comput.
1
https://doi.org/10.1287/ijoc.1040.0078
db/journals/informs/informs18.html#ForrestKL06
Francisco Barahona
Laszlo Ladányi
Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut.
53-73
2006
40
RAIRO Oper. Res.
1
https://doi.org/10.1051/ro:2006010
db/journals/rairo/rairo40.html#BarahonaL06
Oktay Günlük
Tracy Kimbrel
Laszlo Ladányi
Baruch Schieber
Gregory B. Sorkin
Vehicle Routing and Staffing for Sedan Service.
313-326
2006
40
Transp. Sci.
3
https://doi.org/10.1287/trsc.1050.0122
db/journals/transci/transci40.html#GunlukKLSS06
Laszlo Ladányi
Jon Lee 0001
Robin Lougee-Heimer
Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem.
243-265
2005
139
Ann. Oper. Res.
1
https://doi.org/10.1007/s10479-005-3450-1
db/journals/anor/anor139.html#LadanyiLL05
Marta Eso
Soumyadip Ghosh
Jayant Kalagnanam
Laszlo Ladányi
Bid Evaluation in Procurement Auctions with Piecewise Linear Supply Curves.
147-173
2005
11
J. Heuristics
2
https://doi.org/10.1007/s10732-005-0389-y
db/journals/heuristics/heuristics11.html#EsoGKL05
Oktay Günlük
Laszlo Ladányi
Sven de Vries
A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions.
391-406
2005
51
Manag. Sci.
3
https://doi.org/10.1287/mnsc.1040.0332
db/journals/mansci/mansci51.html#GunlukLV05
Ted K. Ralphs
Laszlo Ladányi
Matthew J. Saltzman
A Library Hierarchy for Implementing Scalable Parallel Search Algorithms.
215-234
2004
28
J. Supercomput.
2
https://doi.org/10.1023/B:SUPE.0000020179.55383.ad
db/journals/tjs/tjs28.html#RalphsLS04
Ted K. Ralphs
Laszlo Ladányi
Matthew J. Saltzman
Parallel branch, cut, and price for large-scale discrete optimization.
253-280
2003
98
Math. Program.
1-3
https://doi.org/10.1007/s10107-003-0404-8
db/journals/mp/mp98.html#RalphsLS03
Laszlo Ladányi
Ted K. Ralphs
Matthew J. Saltzman
Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications.
592-602
2002
conf/iccS/2002-1
International Conference on Computational Science (1)
https://doi.org/10.1007/3-540-46043-8_60
db/conf/iccS/iccS2002-1.html#LadanyiRS02
Laszlo Ladányi
Ted K. Ralphs
Leslie E. Trotter Jr.
Branch, Cut, and Price: Sequential and Parallel.
223-260
2001
conf/cco/2001
Computational Combinatorial Optimization
https://doi.org/10.1007/3-540-45586-8_6
db/conf/cco/cco2001.html#LadanyiRT01
Marta Eso
Laszlo Ladányi
Ted K. Ralphs
Leslie E. Trotter Jr.
Fully Parallel Generic Branch-and-Cut.
1997
conf/ppsc/1997
PP
db/conf/ppsc/ppsc1997.html#EsoLRT97
Robert G. Bland
Joseph Cheriyan
David L. Jensen
Laszlo Ladányi
An Empirical Study of Min Cost Flow Algorithms for the Minimum-Cost Flow Problem.
119-156
1991
Network Flows And Matching
conf/dimacs/dimacs12
db/conf/dimacs/dimacs12.html#BlandCJL91
https://doi.org/10.1090/dimacs/012/06
Francisco Barahona
Robert G. Bland
Joseph Cheriyan
Pawan Chowdhary
Marta Eso
Markus Ettl
John J. H. Forrest
Soumyadip Ghosh
Oktay Günlük
Pu Huang
David L. Jensen
Jayant Kalagnanam
Tracy Kimbrel
Jon Lee 0001
Young M. Lee
Robin LougeeRobin Lougee-Heimer
Ted K. Ralphs
Matthew J. Saltzman
Baruch Schieber
Gregory B. Sorkin
Karthik Sourirajan
Maxim Sviridenko
Grzegorz Swirszcz
Leslie E. Trotter Jr.
Sven de Vries
Y. Xu