Laszlo Ladányi

14 papers Misc 1Journal 10Unranked 3
YearRankTypeTitle / Venue / Authors
2009 J jnl
Computational Experience with a Software Framework for Parallel Integer Programming.
INFORMS J. Comput.
Y. Xu, Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman
2007 J jnl
Inventory allocation and transportation scheduling for logistics of network-centric military operations.
IBM J. Res. Dev.
Francisco Barahona, Pawan Chowdhary, Markus Ettl, Pu Huang, Tracy Kimbrel, Laszlo Ladányi, Young M. Lee, Baruch Schieber, Karthik Sourirajan, Maxim Sviridenko, Grzegorz Swirszcz
2006 J jnl
A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints.
INFORMS J. Comput.
John J. H. Forrest, Jayant Kalagnanam, Laszlo Ladányi
2006 J jnl
Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut.
RAIRO Oper. Res.
Francisco Barahona, Laszlo Ladányi
2006 J jnl
Vehicle Routing and Staffing for Sedan Service.
Transp. Sci.
Oktay Günlük, Tracy Kimbrel, Laszlo Ladányi, Baruch Schieber, Gregory B. Sorkin
2005 J jnl
A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions.
Manag. Sci.
Oktay Günlük, Laszlo Ladányi, Sven de Vries
2005 J jnl
Bid Evaluation in Procurement Auctions with Piecewise Linear Supply Curves.
J. Heuristics
Marta Eso, Soumyadip Ghosh, Jayant Kalagnanam, Laszlo Ladányi
2005 J jnl
Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem.
Ann. Oper. Res.
Laszlo Ladányi, Jon Lee, Robin Lougee-Heimer
2004 J jnl
A Library Hierarchy for Implementing Scalable Parallel Search Algorithms.
J. Supercomput.
Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman
2003 J jnl
Parallel branch, cut, and price for large-scale discrete optimization.
Math. Program.
Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman
2002 Misc conf
Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications.
International Conference on Computational Science (1)
Laszlo Ladányi, Ted K. Ralphs, Matthew J. Saltzman
2001 — conf
Branch, Cut, and Price: Sequential and Parallel.
Computational Combinatorial Optimization
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter Jr.
1997 — conf
Fully Parallel Generic Branch-and-Cut.
PP
Marta Eso, Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter Jr.
1991 — conf
An Empirical Study of Min Cost Flow Algorithms for the Minimum-Cost Flow Problem.
Network Flows And Matching
Robert G. Bland, Joseph Cheriyan, David L. Jensen, Laszlo Ladányi