Laszlo Ladanyi

From MaRDI portal
Revision as of 00:48, 13 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Laszlo Ladanyi to Laszlo Ladanyi: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:817188

Available identifiers

zbMath Open ladanyi.laszloMaRDI QIDQ817188

List of research outcomes





PublicationDate of PublicationType
A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints2012-06-18Paper
A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions2012-02-21Paper
Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut2007-04-05Paper
Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem2006-03-07Paper
Bid evaluation in procurement auctions with piecewise linear supply curves2005-11-07Paper
A library hierarchy for implementing scalable parallel search algorithms2005-04-07Paper
https://portal.mardi4nfdi.de/entity/Q47390382004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47359402004-08-09Paper
Parallel branch, cut, and price for large-scale discrete optimization2004-03-11Paper
https://portal.mardi4nfdi.de/entity/Q42834391994-03-10Paper

Research outcomes over time

This page was built for person: Laszlo Ladanyi

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:817188&oldid=10989182"
Powered by MediaWiki