home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!ogicse!mimbres.cs.unm.edu!nmt.edu!borchers
- From: borchers@nmt.edu (Brian Borchers)
- Newsgroups: sci.math
- Subject: Mixed Integer Linear Programming: sample problems
- Message-ID: <1992Nov15.015048.1742@nmt.edu>
- Date: 15 Nov 92 01:50:48 GMT
- Article-I.D.: nmt.1992Nov15.015048.1742
- Sender: news@nmt.edu
- Organization: New Mexico Tech
- Lines: 29
- Nntp-Posting-Host: titan
-
- It's been a couple of years since I first made this request, so I thought
- a repost might be helpful.
-
- I'm looking for large zero-one mixed integer linear programming problems.
- By large, I mean that the problem should have thousands of variables
- and at least a few hundred constraints. I'm interested in problems
- with up to about 100 integer variables. I'm also interested in applications
- of these problems. So far, the problems that I have seen are mostly
- facility location/fixed charged network design problems.
-
- Yes, I'm familiar with the MIPLIB collection. MIPLIB contains a number
- of interesting problems, including mod011, rentacar, modglob, and khb05250.
- Some of these problems are extremely hard to solve. Unforutnately, most
- of the rest of the problems in MIPLIB are pure zero-one problems which
- aren't of much interest to me.
-
- Why am I looking for these problems? I'm doing research into branch
- and bound algorithms that use LP relaxations to obtain bounds. For
- pure IP's, there are a number of better techniques (take a look into
- implicit enumeration, problem reformulation, cutting planes, and
- rounding heuristics.) For large mixed problems, branch and bound
- with LP relaxations still seems to be the way to go.
-
- ---------------------------------------------------------------------------
- Brian Borchers borchers@nmt.edu
- Department Of Mathematics New Mexico, home of the green
- New Mexico Tech chile cheeseburger.
- Socorro, NM 87801
-
-