Binary Integer Programming Task: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "). * <B>Counter-" to "). ** ... * <B>Counter-") |
m (Text replacement - "** ..." to "** …") |
||
| Line 3: | Line 3: | ||
* <B>Context:</B> | * <B>Context:</B> | ||
** It can be solved by a [[System]] (that implements a [[Algorithm]]). | ** It can be solved by a [[System]] (that implements a [[Algorithm]]). | ||
** | ** … | ||
* <B>Counter-Example(s):</B> | * <B>Counter-Example(s):</B> | ||
** a [[Mixed Integer Programming Task]]. | ** a [[Mixed Integer Programming Task]]. | ||
Revision as of 23:47, 26 February 2021
A Binary Integer Programming Task is an Integer Linear Programming Task whose Hidden Variables are Binary Variables.
- AKA: 0-1 Integer Program, Binary Integer Program, BIP.
- Context:
- Counter-Example(s):
- See: Basic Income Program, Linear Programming Task.
References
1998
- M. Cecilia Bastarrica, Alexander A. Shvartsman, and Steven A. Demurjian. (1998). “A Binary Integer Programming Model for Optimal Object Distribution.” In: OPODIS.