Laszlo Ladányi

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2009
Computational Experience with a Software Framework for Parallel Integer Programming.
INFORMS J. Comput., 2009

2007
Inventory allocation and transportation scheduling for logistics of network-centric military operations.
IBM J. Res. Dev., 2007

2006
Vehicle Routing and Staffing for Sedan Service.
Transp. Sci., 2006

Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut.
RAIRO Oper. Res., 2006

A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints.
INFORMS J. Comput., 2006

2005
A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions.
Manag. Sci., 2005

Bid Evaluation in Procurement Auctions with Piecewise Linear Supply Curves.
J. Heuristics, 2005

Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem.
Ann. Oper. Res., 2005

2004
A Library Hierarchy for Implementing Scalable Parallel Search Algorithms.
J. Supercomput., 2004

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

2002
Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications.
Proceedings of the Computational Science - ICCS 2002, 2002

2001
Branch, Cut, and Price: Sequential and Parallel.
Proceedings of the Computational Combinatorial Optimization, 2001

1997
Fully Parallel Generic Branch-and-Cut.
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.
Proceedings of the Network Flows And Matching, 1991


  Loading...