MIPLIB 2003

被引：112

作者：

Achterberg, Tobias

Koch, Thorsten

Martin, Alexander

机构：

[1] Zuse Inst Berlin, Berlin, Germany

[2] Tech Univ Darmstadt, D-64287 Darmstadt, Germany

来源：

OPERATIONS RESEARCH LETTERS | 2006年 / 34卷 / 04期

关键词：

Mixed Integer Programming; problem instances; IP; MIP; MIPLIB;

D O I：

10.1016/j.orl.2005.07.009

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper reports on the fourth version of the Mixed Integer Programming Library. Since MIPLIB is to provide a concise set of challenging problems, it became necessary to purge instances that became too easy. We present an overview of the 27 new problems and statistical data for all 60 instances. (c) 2005 Elsevier B.V. All rights reserved.

引用

页码：361 / 372

页数：12

共 22 条

[1]

BELOTTI P, 2003, P 2003 INT NETW OPT, P72

[2]

Bixby R., 1992, SIAM News, V25, P16

[3]

Bixby RE, 1998, Optima, V58, P12

[4]

BLEY A, 2002, 0241 ZUS I

[5]

Borndorfer R., 1998, THESIS TU BERLIN

[6]

BORNDORFER R, 2003, MATH KEY TECHNOLOGY, P441

[7]

DITTEL A, 2005, PROTEIN FOLDING INTE

[8]

EISENBLATTER A, 2003, D43

[9]

GANGADWALA J, 2005, EUR S COMP AID PROC

[10] A branch-and-cut approach for solving railway line-planning problems [J].

Goossens, JW ;

van Hoesel, S ;

Kroon, L .

TRANSPORTATION SCIENCE, 2004, 38 (03) :379-393

← 1 2 3 →