Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

SOFSEM
2007
Springer

favoriteEmaildiscussreport

127views Theoretical Computer Science» more SOFSEM 2007»

A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems

13 years 10 months ago

A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems

Download www.sofsem.cz

Dominique Quadri, Éric Soutif, Pierre Tolla

Real-time Traffic

SOFSEM 2007 | Theoretical Computer Science |

claim paper

Related Content

» Solving LargeScale QAP Problems in Parallel with the Search Library ZRAM

» Solving Large Scale Binary Quadratic Problems Spectral Methods vs Semidefinite Programming

» A Hybrid Method for Solving LargeScale Supply Chain Problems

» A Parallel Mixture of SVMs for Very Large Scale Problems

» SNOPT An SQP Algorithm for LargeScale Constrained Optimization

» Solving large scale combinatorial optimization using PMASLS

» Solving quadratically constrained geometrical problems using lagrangian duality

» Cutting plane algorithms for 01 programming based on cardinality cuts

» A Gaussian Belief Propagation Solver for Large Scale Support Vector Machines

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	SOFSEM
Authors	Dominique Quadri, Éric Soutif, Pierre Tolla

Comments (0)