-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathmetaContributions.json
399 lines (399 loc) · 23.1 KB
/
metaContributions.json
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
{
"desc": "Sub repositories at MOrepo without MOrepo prefix that are part of MOrepo.",
"repos": ["Gadegaard16", "Pedersen08", "Tuyttens00", "Hansen00", "Adelgren16", "Forget20", "Forget21", "Lyngesen24", "An22", "Kirlik14"],
"repoInfo": {
"Gadegaard16": {
"contributionName": "Gadegaard16",
"maintainer": "Sune Lauth Gadegaard <sgadegaard@econ.au.dk>",
"algorithm": "https://github.com/SuneGadegaard/BOCBLP",
"instanceGroups": [
{
"subfolder": "CFLP_UFLP",
"class": "Facility Location",
"objectives": 2,
"tags": ["capacitated", "CFLP", "UFLP", "uncapacitated"],
"format": "raw",
"desc": "Instances for the capacitated and uncapacitated facility location problems.",
"creator": "Sune Lauth Gadegaard <sgadegaard@econ.au.dk>"
},
{
"subfolder": "SSCFLP",
"class": "Facility Location",
"objectives": 2,
"tags": ["singleSource", "capacitated", "singleSourceCapacitated", "SSCFLP"],
"format": "raw",
"desc": "Instances for the single source capacitated facility location problem.",
"creator": "Sune Lauth Gadegaard <sgadegaard@econ.au.dk>"
}
],
"bib": "@Article{Gadegaard16b,\n author = {S.L. Gadegaard and A. Klose and L.R. Nielsen},\n title = {A bi-objective approach to discrete cost-bottleneck location problems},\n journal = {Annals of Operations Research},\n year = {2016},\n pages = {1--23},\n abstract = {This paper considers a family of bi-objective discrete facility location problems with a cost objective and a bottleneck objective. A special case is, for instance, a bi-objective version of the (vertex) p-centdian problem. We show that bi-objective facility location problems of this type can be solved efficiently by means of an epsilon-constraint method that solves at most (n-1)m minisum problems, where n is the number of customer points and m the number of potential facility sites. Additionally, we compare the approach to a lexicographic epsilon-constrained method that only returns efficient solutions and to a two-phase method relying on the perpendicular search method. We report extensive computational results obtained from several classes of facility location problems. The proposed algorithm compares very favorably to both the lexicographic epsilon-constrained method and to the two phase method.},\n doi = {10.1007/s10479-016-2360-8},\n}\n\n"
},
"Pedersen08": {
"contributionName": "Pedersen08",
"maintainer": "Lars Relund <junk@relund.dk>",
"instanceGroups": [
{
"subfolder": "AP",
"class": "Assignment",
"objectives": 2,
"tags": ["ap", "assignmentProblem", "bi-AP"],
"format": "xml",
"desc": "Instances for the bi-objective assignment problem.",
"creator": "Lars Relund <junk@relund.dk>"
},
{
"subfolder": "MMAP",
"class": "Assignment",
"objectives": 2,
"tags": ["bi-MMAP", "MMAP", "multi-modal"],
"format": "xml",
"desc": "Instances for the bi-objective multi-modal assignment problem.",
"creator": "Lars Relund <junk@relund.dk>"
}
],
"resultContributions": ["Pedersen08", "Tuyttens00"],
"bib": "@ARTICLE{Pedersen08,\nauthor = {Pedersen, C.R. and Nielsen, L.R. and Andersen, K.A.},\ntitle = {The Bicriterion Multi Modal Assignment Problem: Introduction, Analysis, and Experimental Results},\nyear = {2008},\nvolume = {20},\nnumber = {3},\njournal = {Informs Journal on Computing},\ninstitution = {Department of Operations Research, University of Aarhus},\nschool = {Department of Operations Research, University of Aarhus},\npages = {400--411},\ndoi = {10.1287/ijoc.1070.0253},\nabstract = {We consider the bicriterion multi modal assignment problem which is a new generalization of the classical linear assignment problem. A two-phase solution method using an effective ranking scheme is presented. The algorithm is valid for generating all nondominated criterion points or an approximation. Extensive computational results are conducted on a large library of test instances to test the performance of the algorithm and to identify hard test instances. Also, test results of the algorithm applied to the bicriterion assignment problem is provided.},\n}\n"
},
"Tuyttens00": {
"contributionName": "Tuyttens00",
"maintainer": "Lars Relund <junk@relund.dk>",
"instanceGroups": [
{
"subfolder": "",
"class": "Assignment",
"objectives": 2,
"tags": ["ap", "assignmentProblem", "bi-AP"],
"format": ["raw", "xml"],
"desc": "Instances for the bi-objective assignment problem.",
"creator": "D. Tuyttens, J. Teghem, Ph. Fortemps and K. van Nieuwenhuyze"
}
],
"bib": "@Article{Tuyttens00,\nauthor={Tuyttens, D. and Teghem, J. and Fortemps, Ph. and Nieuwenhuyze, K. Van},\ntitle={Performance of the MOSA Method for the Bicriteria Assignment Problem},\njournal={Journal of Heuristics},\nyear={2000},\nvolume={6},\nnumber={3},\npages={295--310},\ndoi={10.1023/A:1009670112978},\n}\n"
},
"Hansen00": {
"contributionName": "Hansen00",
"maintainer": "Thomas Stidsen <thst@dtu.dk>",
"instanceGroups": [
{
"subfolder": "",
"class": "Traveling Salesman",
"objectives": 2,
"tags": ["BITSP", "travelling-salesman-problem", "BI-TSP"],
"format": "raw",
"desc": "Instances for the bi-objective travelling salesman problem.",
"creator": "Michael Hansen"
}
],
"bib": "@Article{Hansen00,\nauthor=\"M.P. Hansen\",\ntitle=\"Use of Substitute Scalarizing Functions to Guide a Local Search Based Heuristic: The Case of moTSP\",\njournal=\"Journal of Heuristics\",\nyear=\"2000\",\nmonth=\"Aug\",\nday=\"01\",\nvolume=\"6\",\nnumber=\"3\",\npages=\"419--431\",\ndoi=\"10.1023/A:1009690717521\"\n}\n"
},
"Adelgren16": {
"contributionName": "Adelgren16",
"maintainer": "Nathan Adelgren <nadelgren@edinboro.edu>",
"instanceGroups": [
{
"subfolder": "LP_1",
"class": "MILP",
"objectives": 2,
"format": "lp",
"desc": "Instances extended from single-objective instances from MIPlib 2010. Note that we do NOT claim to have created these instances -- we have only added additional objectives.",
"creator": "Nathan Adelgren <nadelgren@edinboro.edu>"
},
{
"subfolder": "LP_2",
"class": "MILP",
"objectives": 3,
"format": "lp",
"desc": "Instances extended from single-objective instances from MIPlib 2010. Note that we do NOT claim to have created these instances -- we have only added additional objectives.",
"creator": "Nathan Adelgren <nadelgren@edinboro.edu>"
},
{
"subfolder": "LP_3",
"class": "MILP",
"objectives": 4,
"format": "lp",
"desc": "Instances extended from single-objective instances from MIPlib 2010. Note that we do NOT claim to have created these instances -- we have only added additional objectives.",
"creator": "Nathan Adelgren <nadelgren@edinboro.edu>"
},
{
"subfolder": "LP_4",
"class": "MILP",
"objectives": 5,
"format": "lp",
"desc": "Instances extended from single-objective instances from MIPlib 2010. Note that we do NOT claim to have created these instances -- we have only added additional objectives.",
"creator": "Nathan Adelgren <nadelgren@edinboro.edu>"
},
{
"subfolder": "LP_5",
"class": "MILP",
"objectives": 6,
"format": "lp",
"desc": "Instances extended from single-objective instances from MIPlib 2010. Note that we do NOT claim to have created these instances -- we have only added additional objectives.",
"creator": "Nathan Adelgren <nadelgren@edinboro.edu>"
},
{
"subfolder": "LP_6",
"class": "MILP",
"objectives": 7,
"format": "lp",
"desc": "Instances extended from single-objective instances from MIPlib 2010. Note that we do NOT claim to have created these instances -- we have only added additional objectives.",
"creator": "Nathan Adelgren <nadelgren@edinboro.edu>"
}
],
"bib": "@Misc{Adelgren16,\n author = {Adelgren, N. and Gupte, A.},\n title = {Branch-and-bound for biobjective mixed-integer programming},\n howpublished = {Optimization Online},\n year = {2016},\n type = {resreport},\n url = {http://www.optimization-online.org/DB_HTML/2016/10/5676.html},\n}\n"
},
"Forget20": {
"contributionName": "Forget20",
"maintainer": "Lars Relund <lars@relund.dk>",
"rawDesc": "A structured text file with numbers (see ReadMe)",
"instanceGroups": [
{
"subfolder": "AP",
"class": "Assignment",
"objectives": 3,
"tags": ["ap", "assignmentProblem", "tri-AP"],
"format": "raw",
"desc": "Instances for the tri-objective assignment problem.",
"creator": "Nicolas Forget <nforget@econ.au.dk>"
},
{
"subfolder": "KP",
"class": "Knapsack",
"objectives": 3,
"tags": ["kp", "knapsackProblem", "tri-KP"],
"format": "raw",
"desc": "Instances for the tri-objective knapsack problem.",
"creator": "Nicolas Forget <nforget@econ.au.dk>"
},
{
"subfolder": "UFLP",
"class": "Facility Location",
"objectives": 3,
"tags": ["uflp", "uncapacitatedFacilityLocationProblem", "tri-UFLP"],
"format": "raw",
"desc": "Instances for the tri-objective uncapacitated facility location problem.",
"creator": "Nicolas Forget <nforget@econ.au.dk>"
}
],
"resultContributions": "Forget20",
"bib": "@TechReport{Forget20,\n author = {N. Forget and S.L. Gadegaard and K. Klamroth and L.R. Nielsen and A. Przybylski},\n institution = {Optimization Online},\n title = {Branch-and-bound and objective branching with three objectives},\n year = {2020},\n month = {dec},\n url = {http://www.optimization-online.org/DB_FILE/2020/12/8158.pdf},\n}\n"
},
"Forget21": {
"contributionName": "Forget21",
"maintainer": "Lars Relund <junk@relund.dk>",
"instanceGroups": [
{
"subfolder": "PPP/3obj",
"class": "Production Planning",
"objectives": 3,
"tags": ["ppp", "productionPlaningProblem"],
"format": "fgt",
"desc": "Instances for the production planing problem with 3 objectives.",
"creator": "Nicolas Forget <nforget@econ.au.dk>"
},
{
"subfolder": "PPP/4obj",
"class": "Production Planning",
"objectives": 4,
"tags": ["ppp", "productionPlaningProblem"],
"format": "fgt",
"desc": "Instances for the production planing problem with 4 objectives.",
"creator": "Nicolas Forget <nforget@econ.au.dk>"
},
{
"subfolder": "PPP/5obj",
"class": "Production Planning",
"objectives": 5,
"tags": ["ppp", "productionPlaningProblem"],
"format": "fgt",
"desc": "Instances for the production planing problem with 5 objectives.",
"creator": "Nicolas Forget <nforget@econ.au.dk>"
},
{
"subfolder": "UFLP/3obj",
"class": "Facility Location",
"objectives": 3,
"tags": ["uflp", "uncapacitatedFacilityLocationProblem"],
"format": "fgt",
"desc": "Instances for the uncapacitated facility location problem with 3 objectives.",
"creator": "Nicolas Forget <nforget@econ.au.dk>"
},
{
"subfolder": "UFLP/4obj",
"class": "Facility Location",
"objectives": 4,
"tags": ["uflp", "uncapacitatedFacilityLocationProblem"],
"format": "fgt",
"desc": "Instances for the uncapacitated facility location problem with 4 objectives.",
"creator": "Nicolas Forget <nforget@econ.au.dk>"
},
{
"subfolder": "UFLP/5obj",
"class": "Facility Location",
"objectives": 5,
"tags": ["uflp", "uncapacitatedFacilityLocationProblem"],
"format": "fgt",
"desc": "Instances for the uncapacitated facility location problem with 5 objectives.",
"creator": "Nicolas Forget <nforget@econ.au.dk>"
}
],
"bib": "@TechReport{Forget21,\n author = {Forget, N. and Gadegaard, S.L. and Nielsen, L.R.},\n institution = {Optimizaton Online},\n title = {Linear relaxation based branch-and-bound for multi-objective integer programming with warm-starting},\n year = {2021},\n abstract = {In this paper we propose a generic branch-and-bound algorithm for solving multi-objective integer linear programming problems. % In the recent literature, competitive frameworks has been proposed for bi-objective 0-1 problems, and many of these frameworks rely on the use of the linear relaxation to obtain lower bound sets. When increasing the number of objective functions, however, the polyhedral structure of the linear relaxation becomes more complex, and consequently requires more computational effort to obtain. In this paper we overcome this obstacle by speeding up the computations. To do so, in each branching node we use information available from its farther node to warm-start a Bensons-like algorithm. We show that the proposed algorithm significantly reduces the CPU time of the framework on several different problem classes with three, four and five objective functions. Moreover, we point out difficulties that arise when non-binary integer variables are introduced in the models, and test our algorithm on problem that contains non-binary integer variables too.},\n journal = {Optimization Online},\n keywords = {forget21a.pdf},\n url = {http://www.optimization-online.org/DB_HTML/2021/08/8531.html},\n}"
},
"Lyngesen24": {
"contributionName": "Lyngesen24",
"maintainer": "Lars Relund <junk@relund.dk>",
"instanceGroups": [
{
"subfolder": "sp/2obj",
"class": "Minkowski Sum - Subset",
"objectives": 2,
"tags": "minkowskiSumSubset",
"format": "json",
"desc": "Subsets used for the Minkowski sum problem.",
"creator": "Lars Relund <junk@relund.dk>"
},
{
"subfolder": "sp/3obj",
"class": "Minkowski Sum - Subset",
"objectives": 3,
"tags": "minkowskiSumSubset",
"format": "json",
"desc": "Subsets used for the Minkowski sum problem.",
"creator": "Lars Relund <junk@relund.dk>"
},
{
"subfolder": "sp/4obj",
"class": "Minkowski Sum - Subset",
"objectives": 4,
"tags": "minkowskiSumSubset",
"format": "json",
"desc": "Subsets used for the Minkowski sum problem.",
"creator": "Lars Relund <junk@relund.dk>"
},
{
"subfolder": "sp/5obj",
"class": "Minkowski Sum - Subset",
"objectives": 5,
"tags": "minkowskiSumSubset",
"format": "json",
"desc": "Subsets used for the Minkowski sum problem.",
"creator": "Lars Relund <junk@relund.dk>"
},
{
"subfolder": "msp/2obj",
"class": "Minkowski Sum",
"objectives": 2,
"tags": ["minkowskiSum", "msp"],
"format": "json",
"desc": "Instance used for the Minkowski sum problem (a set of subsets).",
"creator": "Lars Relund <junk@relund.dk>"
},
{
"subfolder": "msp/3obj",
"class": "Minkowski Sum",
"objectives": 3,
"tags": ["minkowskiSum", "msp"],
"format": "json",
"desc": "Instance used for the Minkowski sum problem (a set of subsets).",
"creator": "Lars Relund <junk@relund.dk>"
},
{
"subfolder": "msp/4obj",
"class": "Minkowski Sum",
"objectives": 4,
"tags": ["minkowskiSum", "msp"],
"format": "json",
"desc": "Instance used for the Minkowski sum problem (a set of subsets).",
"creator": "Lars Relund <junk@relund.dk>"
},
{
"subfolder": "msp/5obj",
"class": "Minkowski Sum",
"objectives": 5,
"tags": ["minkowskiSum", "msp"],
"format": "json",
"desc": "Instance used for the Minkowski sum problem (a set of subsets).",
"creator": "Lars Relund <junk@relund.dk>"
}
],
"resultContributions": "Lyngesen24",
"bib": "@ARTICLE{Lyngesen24,\nauthor = {Lyngesen, M. and Gadegaard S.L. and Nielsen, L.R.},\ntitle = {Generator sets for Minkowski Sums - Theory and Insights},\nyear = {2024},\njournal = {??},\ninstitution = {Department of Economics and Business Economics, BSS, Aarhus University}\n}\n\n@Electronic{MOrepo-Lyngesen24,\n Title = {Minkowski sum problems (MOrepo-Lyngesen24)},\n Author = {M. Lyngesen and L. R. Nielsen},\n Url = {https://github.com/MCDMSociety/MOrepo-Lyngesen24},\n Year = {2024}\n}\n"
},
"An22": {
"contributionName": "An22",
"maintainer": "Lars Relund <junk@relund.dk>",
"instanceGroups": [
{
"subfolder": "CFLP",
"class": "Facility Location",
"objectives": 3,
"tags": ["UFLP", "facilityLocation"],
"format": "fgt",
"desc": "Instances for the capacitated facility location problem (converted to fgt format)",
"creator": "Nicolas Forget <nforget@econ.au.dk>"
}
],
"bib": "@article{An2024,\n title = {A matheuristic for tri-objective binary integer linear programming},\n volume = {161},\n ISSN = {0305-0548},\n url = {http://dx.doi.org/10.1016/j.cor.2023.106397},\n DOI = {10.1016/j.cor.2023.106397},\n journal = {Computers & Operations Research},\n publisher = {Elsevier BV},\n author = {An, Duleabom and Parragh, Sophie N. and Sinnl, Markus and Tricoire, Fabien},\n year = {2024},\n month = jan,\n pages = {106397}\n}\n\n@TechReport{An22,\n author = {An, D. and Parragh, S.N. and Sinnl, N. and Tricoire, F.},\n institution = {Arxiv},\n title = {A matheuristic for tri-objective binary integer programming},\n year = {2022},\n abstract = {Many real-world optimisation problems involve multiple objectives. When considered concurrently, they give rise to a set of optimal trade-off solutions, also known as efficient solutions. These solutions have the property that neither objective can be improved without deteriorating another objective. Motivated by the success of matheuristics in the single-objective domain, we propose a linear programming-based matheuristic for tri-objective binary integer programming. To achieve a high-quality approximation of the optimal set of trade-off solutions, a lower bound set is first obtained using the vector linear programming solver Bensolve. Then, feasibility pump-based ideas in combination with path relinking are applied in novel ways so as to obtain a high quality upper bound set. Our matheuristic is compared to a recently-suggested algorithm that is, to the best of our knowledge, the only existing matheuristic method for tri-objective integer programming. In an extensive computational study, we show that our method generates a better approximation of the true Pareto front than the benchmark method on a large set of tri-objective benchmark instances. Since the developed approach starts from a potentially fractional lower bound set, it may also be used as a primal heuristic in the context of linear relaxation-based multi-objective branch-and-bound algorithms. },\n journal = {Arxiv},\n url = {https://arxiv.org/abs/2205.03386}\n}"
},
"Kirlik14": {
"contributionName": "Kirlik14",
"maintainer": "Lars Relund <junk@relund.dk>",
"instanceGroups": [
{
"subfolder": "ILP/3obj",
"class": "ILP",
"objectives": 3,
"tags": ["ilp", "integer"],
"format": "fgt",
"desc": "Randomly generated integer problems with 3 objectives. Note that we do NOT claim to have created these instances, but only transformed them into a different text format.",
"creator": "Nicolas Forget <nforget@econ.au.dk>"
},
{
"subfolder": "ILP/4obj",
"class": "ILP",
"objectives": 3,
"tags": ["ilp", "integer"],
"format": "fgt",
"desc": "Randomly generated integer problems with 4 objectives. Note that we do NOT claim to have created these instances, but only transformed them into a different text format.",
"creator": "Nicolas Forget <nforget@econ.au.dk>"
},
{
"subfolder": "ILP/5obj",
"class": "ILP",
"objectives": 3,
"tags": ["ilp", "integer"],
"format": "fgt",
"desc": "Randomly generated integer problems with 5 objectives. Note that we do NOT claim to have created these instances, but only transformed them into a different text format.",
"creator": "Nicolas Forget <nforget@econ.au.dk>"
},
{
"subfolder": "KP/3obj",
"class": "Knapsack",
"objectives": 3,
"tags": "knapsackProblem",
"format": "fgt",
"desc": "Knapsack problems with 3 objectives. Note that we do NOT claim to have created these instances, but only transformed them into a different text format.",
"creator": "Nicolas Forget <nforget@econ.au.dk>"
},
{
"subfolder": "KP/4obj",
"class": "Knapsack",
"objectives": 3,
"tags": "knapsackProblem",
"format": "fgt",
"desc": "Knapsack problems with 4 objectives. Note that we do NOT claim to have created these instances, but only transformed them into a different text format.",
"creator": "Nicolas Forget <nforget@econ.au.dk>"
},
{
"subfolder": "KP/5obj",
"class": "Knapsack",
"objectives": 3,
"tags": "knapsackProblem",
"format": "fgt",
"desc": "Knapsack problems with 5 objectives. Note that we do NOT claim to have created these instances, but only transformed them into a different text format.",
"creator": "Nicolas Forget <nforget@econ.au.dk>"
}
],
"bib": "@Article{Kirlik14,\n Title = {A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems},\n Author = {G. Kirlik and S. Sayın},\n Journal = {European Journal of Operational Research},\n Year = {2014},\n Number = {3},\n Pages = {479 - 488},\n Volume = {232},\n Doi = {10.1016/j.ejor.2013.08.001},\n}"
}
}
}