Integer Linear Programming Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replace - " (2008)" to " (2008)") |
m (Text replacement - "]]↵*" to "]]. *") |
||
(24 intermediate revisions by 3 users not shown) | |||
Line 1: | Line 1: | ||
An [[Integer Linear Programming Algorithm]] is a [[linear programming algorithm]] that can solve an [[ | An [[Integer Linear Programming Algorithm]] is a [[linear programming algorithm]] that can solve an [[integer linear programming task]]. | ||
* <B | * <B>AKA:</B> [[Integer Programming]], [[IP]], [[ILP]]. | ||
* <B | * <B>Example(s):</B> | ||
** a [[Branch and Bound Algorithm]]. | ** a [[Branch and Bound Algorithm]]. | ||
** a [[Rounding Integer Linear Programming Algorithm]], | ** a [[Rounding Integer Linear Programming Algorithm]], | ||
* <B | * <B>Counter-Example(s):</B> | ||
** [[Linear Programming Algorithm]] | ** [[Linear Programming Algorithm]]. | ||
* <B | * <B>See:</B> [[Linear Programming Task]]. | ||
---- | ---- | ||
---- | ---- | ||
===2009=== | == References == | ||
=== 2009 === | |||
* http://en.wikipedia.org/wiki/Linear_programming#Integer_unknowns | * http://en.wikipedia.org/wiki/Linear_programming#Integer_unknowns | ||
** QUOTE: Advanced algorithms for solving integer linear programs include: | ** QUOTE: Advanced algorithms for solving integer linear programs include: | ||
*** [[cutting-plane method]] | *** [[cutting-plane method]]. | ||
*** [[branch and bound]] | *** [[branch and bound]]. | ||
*** [[branch and cut]] | *** [[branch and cut]] | ||
*** [[branch and price]] | *** [[branch and price]]. | ||
** if the problem has some extra structure, it may be possible to apply [[delayed column generation]]. | ** if the problem has some extra structure, it may be possible to apply [[delayed column generation]]. | ||
===2008=== | === 2008 === | ||
* ([[2008_Lecture17_ILP|Vandenberghe, 2008]]) | * ([[2008_Lecture17_ILP|Vandenberghe, 2008]]) ⇒ Lieven Vandenberghe. ([[2008]]). “[http://www.ee.ucla.edu/ee236a/lectures/intlp.pdf Lecture 17 - Integer Linear Programming]." EE236A - Linear Programming (Fall 2007-08) UCLA | ||
===1998=== | === 1998 === | ||
* ([[1998_TheoryOfLinearAndIntegerProg|Schrijver, 1998]]) | * ([[1998_TheoryOfLinearAndIntegerProg|Schrijver, 1998]]) ⇒ Alexander Schrijver. ([[1998]]). “[http://books.google.com/books?id=zEzW5mhppB8C Theory of Linear and Integer Programming]." Wiley. ISBN:0471982326 | ||
** In this chapter we describe some introductory theory for integer linear programming. | ** In this chapter [[we]] describe some introductory theory for integer linear programming. | ||
---- | ---- |
Latest revision as of 17:52, 4 October 2023
An Integer Linear Programming Algorithm is a linear programming algorithm that can solve an integer linear programming task.
- AKA: Integer Programming, IP, ILP.
- Example(s):
- Counter-Example(s):
- See: Linear Programming Task.
References
2009
- http://en.wikipedia.org/wiki/Linear_programming#Integer_unknowns
- QUOTE: Advanced algorithms for solving integer linear programs include:
- if the problem has some extra structure, it may be possible to apply delayed column generation.
2008
- (Vandenberghe, 2008) ⇒ Lieven Vandenberghe. (2008). “Lecture 17 - Integer Linear Programming." EE236A - Linear Programming (Fall 2007-08) UCLA
1998
- (Schrijver, 1998) ⇒ Alexander Schrijver. (1998). “Theory of Linear and Integer Programming." Wiley. ISBN:0471982326
- In this chapter we describe some introductory theory for integer linear programming.