home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!utcsri!bonnie.concordia.ca!cerberus.ulaval.ca!news
- From: GautierA@vm1.ulaval.ca (Antoine Gautier)
- Newsgroups: comp.theory
- Subject: Re: Complexity of Integer Programming.
- Message-ID: <1992Jul28.175208.11058@cerberus.ulaval.ca>
- Date: 28 Jul 92 17:52:08 GMT
- References: <1371@eagle.ukc.ac.uk>
- Sender: news@cerberus.ulaval.ca
- Reply-To: GautierA@vm1.ulaval.ca (Antoine Gautier)
- Organization: Universite Laval
- Lines: 33
-
- In article <1371@eagle.ukc.ac.uk> jkp@ukc.ac.uk (J.K.Pearson) writes:
- >
- > Can some body answear me a simple question, what is the complexity
- of integer
- > programming, (I think it's NP complete but I'm not sure.)
-
- Yes it is! in its general form, IP includes TSP (traveling salesman)
- as well as many other NP Complete subcases.
-
- refer to
- Garey and Johnson:
- Computers and intractability: a Guide to NP Completeness.
-
- or
- Quayle, d. "P = NP; the case P = 1..." (White house press).
-
- -- NewsGrazer, a NeXTstep(tm) news reader, posting --
- M>UQR=&8P7&%N<VE[7&9O;G1T8FQ<9C!<9FUO9&5R;B!#;W5R:65R.WT*7&UA
- M<F=L,3(P"EQM87)G<C$R,`I<<&%R9%QT>#DV,%QT>#$Y,C!<='@R.#@P7'1X
- M,S@T,%QT>#0X,#!<='@U-S8P7'1X-C<R,%QT>#<V.#!<='@X-C0P7'1X.38P
- M,%QF,%QB7&DP7'5L,%QF<S,R($EN(&%R=&EC;&4@/#$S-S%`96%G;&4N=6MC
- M+F%C+G5K/B!J:W!`=6MC+F%C+G5K("A*+DLN4&5A<G-O;BD@=W)I=&5S.EP*
- M/B`@7`H^("!#86X@<V]M92!B;V1Y(&%N<W=E87(@;64@82!S:6UP;&4@<75E
- M<W1I;VXL('=H870@:7,@=&AE(&-O;7!L97AI='D@;V8@:6YT96=E<EP*/B`@
- M<')O9W)A;6UI;F<L("A)('1H:6YK(&ET)W,@3E`@8V]M<&QE=&4@8G5T($DG
- M;2!N;W0@<W5R92XI7`I<"EEE<R!I="!I<R$@:6X@:71S(&=E;F5R86P@9F]R
- M;2P@25`@:6YC;'5D97,@5%-0("AT<F%V96QI;F<@<V%L97-M86XI(&%S('=E
- M;&P@87,@;6%N>2!O=&AE<B!.4"!#;VUP;&5T92!S=6)C87-E<RX@7`I<"G)E
- M9F5R('1O7`I'87)E>2!A;F0@2F]H;G-O;CI<"D-O;7!U=&5R<R!A;F0@:6YT
- M<F%C=&%B:6QI='DZ(&$@1W5I9&4@=&\@3E`@0V]M<&QE=&5N97-S+EP*7`IO
- M<EP*475A>6QE+"!D+B`@(E`@/2!.4#L@=&AE(&-A<V4@4"`](#$N+BXB("A7
- 5:&ET92!H;W5S92!P<F5S<RDN"GT*
- `
-