Laszlo Ladányi

According to our database, Laszlo Ladányi authored at least 14 papers between 1991 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2009

Computational Experience with a Software Framework for Parallel Integer Programming.

Y. Xu, Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman

INFORMS J. Comput., 2009

2007

Inventory allocation and transportation scheduling for logistics of network-centric military operations.

Francisco Barahona, Pawan Chowdhary, Markus Ettl, Pu Huang, Tracy Kimbrel, Laszlo Ladányi, Young M. Lee, Baruch Schieber, Karthik Sourirajan, Maxim Sviridenko, Grzegorz Swirszcz

IBM J. Res. Dev., 2007

2006

Vehicle Routing and Staffing for Sedan Service.

Oktay Günlük, Tracy Kimbrel, Laszlo Ladányi, Baruch Schieber, Gregory B. Sorkin

Transp. Sci., 2006

Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut.

Francisco Barahona, Laszlo Ladányi

RAIRO Oper. Res., 2006

A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints.

John J. H. Forrest, Jayant Kalagnanam, Laszlo Ladányi

INFORMS J. Comput., 2006

2005

A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions.

Oktay Günlük, Laszlo Ladányi, Sven de Vries

Manag. Sci., 2005

Bid Evaluation in Procurement Auctions with Piecewise Linear Supply Curves.

Marta Eso, Soumyadip Ghosh, Jayant Kalagnanam, Laszlo Ladányi

J. Heuristics, 2005

Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem.

Laszlo Ladányi, Jon Lee, Robin Lougee-Heimer

Ann. Oper. Res., 2005

2004

A Library Hierarchy for Implementing Scalable Parallel Search Algorithms.

Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman

J. Supercomput., 2004

2003

Parallel branch, cut, and price for large-scale discrete optimization.

Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman

Math. Program., 2003

2002

Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications.

Laszlo Ladányi, Ted K. Ralphs, Matthew J. Saltzman

Proceedings of the Computational Science - ICCS 2002, 2002

2001

Branch, Cut, and Price: Sequential and Parallel.

Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter Jr.

Proceedings of the Computational Combinatorial Optimization, 2001

1997

Fully Parallel Generic Branch-and-Cut.

Marta Eso, Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter Jr.

Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997

1991

An Empirical Study of Min Cost Flow Algorithms for the Minimum-Cost Flow Problem.

Robert G. Bland, Joseph Cheriyan, David L. Jensen, Laszlo Ladányi

Proceedings of the Network Flows And Matching, 1991