BOMIP (Bi-Objective Mixed Integer Programming) is a class of problem where two objective functions are minimized subject to linear constraints and integrality on a subset of variables. This project is an implementation of a branch-and-bound algorithm for BOMIP problems.
-
Notifications
You must be signed in to change notification settings - Fork 0
License
merraksh/bomip
About
No description, website, or topics provided.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published