Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

429 Downloads (Pure)

Fingerprint

Dive into the research topics of 'Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets'. Together they form a unique fingerprint.

Computer Science