-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathresearch.html
More file actions
834 lines (678 loc) · 33.3 KB
/
research.html
File metadata and controls
834 lines (678 loc) · 33.3 KB
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
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
<title>Jeff Linderoth's Research</title>
<link href="style/style.css" rel="stylesheet" type=text/css>
</head>
<body>
<!-- This goes on all pages -->
<div id="left_box">
<p align=center>
<img src="images/frink.gif" height="150"></img></a><BR><BR>
</p>
<BR><BR>
<font size="3" face="Arial">
<a href="./index.html">Home</a><BR>
<!-- Links -->
<a href="./research.html">Research</a><br>
<a href="./teaching.html">Teaching</a><br>
<a href="./bio.html">Bio Data</a><br>
<!-- <a href="./links.html">Links</a><br> -->
</font>
</div>
<!-- To here -->
<div id="content_box">
<p>
<h1>Research Interests</h1>
<P>
My research interests lie in solving large-scale numerical
optimization problems. Specific areas on which I have worked include
<UL>
<LI> Mixed-Integer Linear Programming
<LI> Mixed-Integer Nonlinear Programming
<LI> Stochastic Programming
<LI> Global Optimization
<LI> <strong>Applications:</strong> Energy, Defense, Logistics, Security,
Engineering Design, Biology
</UL>
</P>
<P>
<A HREF="http://scholar.google.com/citations?user=gwM2aRIAAAAJ"> My Google scholar profile page</A> has more information about my papers and citations.
</P>
<br>
<h2>Research Publications</h2>
<P>
<strong>Copyright Notice</strong>: The documents distributed by this
server have been provided by the contributing authors as a means to
ensure timely dissemination of scholarly work on a noncommercial
basis. Copyright and all rights therein are maintained by the authors
and/or by other copyright holders, notwithstanding that they have
offered their works here electronically. It is understood that all
persons copying this information will adhere to the terms and
constraints invoked by the authors and other copyright holders. These
works <strong>may not be reposted</strong> without the explicit
permission of the copyright holders.
</P>
<h3>Submitted Papers</h3>
<FONT SIZE=2>
<UL>
<LI> A. Soni, J. Linderoth, J. Luedtke, and D. Pimentel-Alarcon, "An Integer Programming Approach To Subspace Clustering With Missing Data," Submitted, 2023.
<BR><A HREF="https://doi.org/10.48550/arXiv.2309.15285">arXiv</A>
<BR><BR>
</LI>
<LI> A. Del Pia, J. Linderoth, and H. Zhu, "Relaxations and Cutting Planes for Linear Programs with Complementarity Constraints," Submitted, 2022.
<BR><A HREF="https://doi.org/10.48550/arXiv.2208.01244">arXiv</A>
<BR><BR>
</LI>
<LI> A. Raghunathan and J. Linderoth, "Stability Analysis of Discrete-Time Linear Complementarity Systems," Submitted, 2020.
<BR><A HREF="http://www.optimization-online.org/DB_FILE/2020/12/8175.pdf">Preprint at Optimization Online</A>
<BR><BR>
</LI>
</UL>
<h3>Journal Publications</h3>
<UL>
<LI> C. Michini, P. Ohmann, B. Libit, and J. Linderoth, "A Set Covering Approach to Customized Coverage Instrumentation," <I>INFORMS Journal on Computing</I>, 36-1: 21-38, 2024.
<BR><A HREF="https://doi.org/10.1287/ijoc.2021.0349">Publisher Site</A>
<BR><BR>
</LI>
<LI> A. Del Pia, J. Linderoth, and H, Zhu, "On the Complexity of Separating Cutting Planes for the Knapsack Polytope," <I>Mathematical Programming, Series B</I>, 2023.
<BR><A HREF="https://doi.org/10.1007/s10107-023-01963-3">Publisher Site</A>
<BR><A HREF="https://doi.org/10.48550/arXiv.2111.06556">arXiv</A>
<BR><BR>
</LI>
<LI> A. Del Pia, J. Linderoth, and H. Zhu, "Multi-cover Inequalities for Totally-Ordered Knapsack Sets," <I>Mathematical Programming, Series B</I>, 197:847-875, 2023.
<BR><A HREF="https://doi.org/10.1007/s10107-022-01817-4">Publisher Site</A>
<BR><A HREF="http://www.optimization-online.org/DB_HTML/2020/11/8107.html">Preprint at Optimization Online</A>
<BR><BR>
</LI>
<LI> Z. Peng, D. Baum, and J. Linderoth, "The Hierarchical Organization of Autocatalytic Reaction Networks and its Relevance to Origin of Life," <I>PLOS Computational Biology</I>, 2022.
<BR><A HREF="https://doi.org/10.1371/journal.pcbi.1010498">Publisher Site</A>
<BR><BR>
</LI>
<LI> A. Mahajan, S. Leyffer, J. Linderoth, J, Luedtke, and T. Munson, "Minotaur: A Mixed-Integer Nonlinear Optimization Toolkit", <I>Mathematical Programming Computation</I>,13:301-338, 2021.
<BR><A HREF="https://doi.org/10.1007/s12532-020-00196-1">Publisher Site</A>
<BR><A HREF="http://www.optimization-online.org/DB_HTML/2017/10/6275.html">Preprint at Optimization Online</A>
<BR><BR>
</LI>
<LI> A. Gleixner, G. Hendel, G. Gamrath, T. Achterberg, M. Bastubbe, T. Berthold, P. M. Christophel, K. Jarck, T. Koch, J. Linderoth, M. Lubbecke, H. D. Mittelmann, D. Ozyurt, T. K. Ralphs, D. Salvagnin, and Y. Shinano, "MIPLIB 2017: Data-Driven Compilation of the 6th Mixed-Integer Programming Library," <I>Mathematical Programming Computation</I>, 13-3:443-490, 2021.
<BR> <A HREF="https://doi.org/10.1007/s12532-020-00194-3">Publisher Site</A>
<BR> <A HREF="http://www.optimization-online.org/DB_FILE/2019/07/7285.pdf">Preprint at Optimization Online</A>
<BR><BR>
</LI>
<LI>C. Lim, J. Linderoth, J. Luedtke, and S. J. Wright,
"Parallelizing Subgradient Methods for the Lagrangian Dual in
Stochastic Mixed-Integer Programming," <I>INFORMS Journal on Optimization</I>, 3-1:1-22, 2021.
<BR><A HREF="https://pubsonline.informs.org/doi/abs/10.1287/ijoo.2019.0029"> Publisher Site</A>
<BR><A HREF="http://www.optimization-online.org/DB_HTML/2018/12/6963.html">Preprint at Optimization Online</A>
<BR><BR>
</LI>
<LI> K. Sundar, H. Nagarajan, S. Wang, J. Linderoth, and R. Bent, "Piecewise Polyhedral Formulations for a Multilinear Term", <I>Operations Research Letters</I>, 49-1:144-149, 2021.
<BR><A HREF="https://www.sciencedirect.com/science/article/abs/pii/S0167637720301905"> Publisher Site</A>
<BR><A HREF="https://arxiv.org/abs/2001.00514">Preprint at arXiv</A>
<BR><BR>
<LI>J. Linderoth, J. Nunez Ares, J. Ostrowski, F. Rossi, and
S. Smriglio, "Orbital Conflict: Cutting Planes for Symmetric
Integer Programs," <I>INFORMS Journal on Optimization</I>, 3-2:139-153, 2021.
<BR><A HREF="https://pubsonline.informs.org/toc/ijoo/3/2"> Publisher Site</A>
<BR><A HREF="http://www.optimization-online.org/DB_HTML/2020/03/7683.html">Preprint at Optimization Online</A>
<BR><A HREF="./data/oc-instances.tar.gz">Instances (tar.gz) from paper</A>
<BR><BR>
<LI> A. Del Pia, D. Gijswijt, J. Linderoth, and H. Zhu, "Integer Packing Sets
Form a Well-Quasi-Ordering," 49-2, 226-230, 2021.
<BR><A HREF="https://doi.org/10.1016/j.orl.2021.01.013"> Publisher Site</A>
<BR><A HREF="http://www.optimization-online.org/DB_HTML/2020/02/7598.html">Preprint at Optimization Online</A>
<BR><BR>
<LI> A. Smith, J. Linderoth, and J. Luedtke, "Optimization-Based
Dispatching Policies for Open-Pit Mining," <I>Optimization and Engineering</I>, accepted, 2020.
<BR><A HREF="https://link.springer.com/article/10.1007/s11081-021-09628-w"> Publisher Site</A>
<BR><A HREF="http://www.optimization-online.org/DB_HTML/2020/02/7646.html">Preprint at Optimization Online</A>
<BR><BR>
<LI> A. Soni, J. Linderoth, J. Luedtke, and F. Rigterink, "Mixed-Integer Linear Programming for Scheduling Unconventional Oil
Field Development," <I>Optimization and Engineering</I>, accepted, 2021.
<BR><A HREF="https://rdcu.be/b5yvO">PDF from Publisher Site</A>
<BR><A HREF="http://www.optimization-online.org/DB_HTML/2020/02/7604.html">Preprint at Optimization Online</A>
<BR><BR>
<LI> J. Luedtke, C. D'Ambrosio, J. Linderoth, and J. Schweiger, "Strong Convex Nonlinear Relaxations of the Pooling Problem," <I>SIAM Journal on Optimization</I>, 30:1582-1609, 2020.
<BR><A HREF="https://doi.org/10.1137/18M1174374">Publisher Site</A>
<BR><A HREF="http://www.optimization-online.org/DB_HTML/2018/03/6515.html">Preprint at Optimization Online</A>
<BR><BR>
<LI>
C. Lim, J. Linderoth, and J. Luedtke, "Valid Inequalities for
Separable Concave Constraints with Indicator Variables", <I>
Mathematical Programming, Series B</I>, 172:415-442, 2018.
<BR><A HREF="https://link.springer.com/article/10.1007/s10107-017-1197-5">Springer Site</A>
<BR><A HREF="papers/Lim-Linderoth-Luedtke-18.pdf">Paper</A>
<BR><BR>
<LI>
P. Bonami and O. Gunluk and J. Linderoth, "Globally Solving
Nonconvex Quadratic Programming Problems with Box Constraints Via Integer Programming Methods," <I>Mathematical Programming Computation</I>, 10-3:333-382, 2018. <B> Honorable Mention, Best Paper in <I>Mathematical Programming Computation</I> in 2018</B>
<BR><A HREF="http://mpc.zib.de/index.php/MPC/article/viewFile/216/136">MPC Site</A>
<BR> <A HREF="http://www.optimization-online.org/DB_HTML/2016/06/5488.html">Preprint at Optimization Online</A>
<BR><BR>
<LI>
N. Boland, J, Christiansen, B. Dandurand, A. Eberhard, J. Linderoth,
J. Luedtke, F. Oliveira, "Combining Progressive Hedging with a
Frank-Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic
Mixed-Integer Programming", <I>SIAM Journal on Optimization</I> 28-2:1312-1336, 2018.
<BR><A HREF="https://epubs.siam.org/doi/10.1137/16M1076290">SIOPT Site</A>
<BR><A HREF="http://www.optimization-online.org/DB_HTML/2016/03/5391.html">Preprint at Optimization Online</A>
<BR><BR>
<LI>
M. Kilinc, J. T. Linderoth, and J. Luedtke, "Effective
Separation of Disjunctive Cuts for Convex Mixed Integer Nonlinear
Programs", <I>Mathematical Programming Computation</I>, <I>Mathematical Programming Computation</I> 9:499-526, 2017.
<BR><A HREF="http://mpc.zib.de/index.php/MPC/article/viewFile/203/123">MPC Site</A>
<BR><BR>
<LI>
H. Jeon, J. Linderoth, and A. Miller, "Quadratic Cone Cutting
Surfaces for Quadratic Programs with On-Off Constraints", <I>Discrete Optimization</I>, 24:32-50, 2017.
<BR>
<A HREF="http://www.sciencedirect.com/science/article/pii/S1572528616300354">DO Site</A> <BR>
<A HREF="http://www.optimization-online.org/DB_HTML/2015/01/4746.html">Preprint at Optimization Online</A>
<BR><BR>
<LI>
E. Anderson and J. Linderoth, "High
Throughput Computing for Massive Scenario Analysis and Optimization
to Minimize Cascading Blackout Risk", <I>IEEE Transactions on Smart Grid</I>, 8:1427-1435, 2017.
<BR>
<A HREF="http://ieeexplore.ieee.org/document/7801915/?reload=true">IEEE Site</A> <BR>
<A HREF="http://www.optimization-online.org/DB_HTML/2015/10/5154.html">Preprint
at Optimization Online</A>
<BR><BR>
<LI>
G. Arastoopour, N. Chesler, J. Linderoth, and D. Williamson
Shaffer, "Data-Enabled Cognitive Modeling: Validating Student
Engineers' Fuzzy Design-based Decision-making", <I> Computer
Applications in Engineering Education</I>, 2017.
<BR>
<A HREF=https://doi.org/10.1002/cae.21851>Wiley Site</A>
<BR><BR>
<LI>
B. Kocuk, H. Jeon, S. Dey, J. Linderoth, J. Luedtke, and A. Sun,
"A Cycle-Based Formulation and Valid Inequalities for DC Power
Transmission Problems with Switching", <I>Operations Research</I>, to appear, 2016.
<BR><A HREF="http://dx.doi.org/10.1287/opre.2015.1471">OR Site</A><BR>
<A HREF="http://www.optimization-online.org/DB_HTML/2014/12/4701.html">Preprint
at Optimization Online</A>
<BR><BR>
<LI> O. Alagoz, M. Ayvaci, and J. T. Linderoth, "Optimally Solving
Markov Decision Processes with Total Expected Discounted Reward
Function: Linear Programming Revisited", <I>Computers &
Industrial Engineering</I>, 87:311-316, 2015.
<BR>
<A HREF="10.1016/j.cie.2015.05.031">Computers & Industrial Engineering Site</A>
<BR><BR>
<LI>
M. Kilinc, J. Linderoth, J. Luedtke, and A. Miller
"Strong Branching Inequalities for Convex Mixed Integer Nonlinear
Programs", <I>Computational Optimization and Applications</I>
59:639-665, 2014.
<BR><A HREF="http://link.springer.com/article/10.1007%2Fs10589-014-9690-8#">COAP Site</A>
<BR><A HREF="papers/Kilinc-Et-Al-14.pdf">Preprint</A>
<BR><BR>
<LI>
S. Sridhar, J. Linderoth, and J. Luedtke, "Models and Solution
Techniques for Production Planning Problems with Increasing
Byproducts", <I>Journal of Global Optimization</I>, 59:597-631, 2014.
<BR><A HREF="http://link.springer.com/article/10.1007%2Fs10898-014-0167-1">JOGO Site</A>
<BR><A HREF="http://www.optimization-online.org/DB_FILE/2014/01/4197.pdf">Tech Report</A>
<BR><BR>
<LI>
S. Sridhar, J. Linderoth, and J. Luedtke, "Locally Ideal
Formulations for Piecewise Linear Functions with Indicator
Variables", <I>Operations Research Letters</I>, 41:627-632, 2013.
<BR><A HREF="http://dx.doi.org/10.1016/j.orl.2013.08.010">OR Letters Site</A>
<BR><A HREF="papers/Sridhar-Linderoth-Luedtke-13-TR.pdf">Tech Report</A>
<BR><BR>
<LI>
P. Belotti, C. Kirches, S. Leyffer, J. Linderoth, J. Luedtke,
and A. Mahajan, "Mixed-Integer Nonlinear Optimization", <I>Acta
Numerica</I>, 22:1-131, 2013.
<BR><A HREF="http://dx.doi.org/10.1017/S0962492913000032">Acta Numerica Site</A>
<BR><A HREF="papers/Belotti-Et-Al-12-TR.pdf">Tech Report</A>
<BR><BR>
<LI>
T. Wu, A. Davoodi, and J. T. Linderoth, "Power-Driven Global
Routing for Multi-Supply Voltage Domains", <I>VLSI Design</I>
2013:1-12, 2013.
<BR><A HREF="papers/Wu-Davoodi-Linderoth-13.pdf">Journal Paper</A>
<BR><BR>
<LI>
J. Luedtke, M. Namazifar, and J. T. Linderoth, "Some Results on
the Strength of Relaxations of Multilinear Functions",
<I>Mathematical Programming, Series B</I>, 136:325-351, 2012.
<BR><A HREF="http://link.springer.com/article/10.1007/s10107-012-0606-z">Math Programming Site</A>
<BR><A HREF="papers/Luedtke-Namazifar-Linderoth-12-TR.pdf">Tech Report</A>
<BR><BR>
<LI>
M. Freimer, J. T. Linderoth, and D. Thomas, "The Impact of Sampling
Methods on Bias and Variance in Stochastic Linear Programs", <I>Computational
Optimization and Applications</I>, 51:51-75, 2012.
<BR><A HREF="http://www.springerlink.com/content/n6217688772774p5/">COAP Site</A>
<BR><A HREF="papers/Friemer-Thomas-Linderoth-05.pdf">Tech Report</A>
<BR><BR>
<LI>
J. Ostrowski, J. T. Linderoth, F. Rossi, and S. Smriglio, "Orbital
Branching," <I>Mathematical Programming</I>, 126:147-178, 2011.
<BR><A HREF="http://www.springerlink.com/content/m441g512l8605451/">Math
Programming Site</A>
<BR>
<A HREF="papers/Ostrowski-Et-Al-09-TR.pdf">Tech Report</A>
<BR><BR>
<LI>
M. Altunay, S. Leyffer, J. T. Linderoth, and Z. Xie, "Optimal
Responses to Attacks on the Open Science Grid," <I>Computer
Networks</I>, 55:61-73, 2011.
<BR><A HREF="http://dx.doi.org/10.1016/j.comnet.2010.07.012">Journal Site</A>
<BR><A HREF="papers/Altunay-Et-Al-09.pdf">Preprint</A>
<BR><BR>
<LI>
J. Ostrowski, J. T. Linderoth, F. Rossi, and S. Smriglio, "Solving
Large Steiner Triple Covering Problems," <I>Operations Research
Letters</I>, 39:127-131, 2011.
<BR><A HREF="http://dx.doi.org/10.1016/j.orl.2011.02.001">Journal Site</A>
<BR><A HREF="papers/Ostrowski-Et-Al-09-2-TR.pdf">Tech Report</A>
<BR><BR>
<LI>
T. Wu, A. Davoodi, and J. T. Linderoth, "GRIP: Global Routing via
Integer Programming", <I>IEEE Transactions on Computer Aided
Design</I>, 30:72-84, 2011.
<BR><A HREF="http://dx.doi.org/10.1109/TCAD.2010.2066030">Journal Site</A>
<BR><A HREF="papers/Wu-Davoodi-Linderoth-10-PP.pdf">Preprint</A>
<BR><BR>
<LI>
B. Gemici, J. T. Linderoth S. D. Wu, and J. Moore, "R&D Project
Portfolio Analysis for the Semiconductor Industry," <I>Operations
Research</I>, 58:1548-1563, 2010.
<BR><A HREF="http://dx.doi.org/10.1287/opre.1100.0832">Journal Site</A>
<BR><A HREF="papers/Gemici-Et-Al-09-TR.pdf">Preprint</A>
<BR><BR>
<LI>
K. Abhishek, S. Leyffer, and J. T. Linderoth, "FilMINT: An Outer
Approximation-Based Solver for Convex Mixed-Integer Nonlinear
Programs", <I>INFORMS Journal on Computing</I>, 22:555-567, 2010.
<BR><A HREF="http://joc.journal.informs.org/cgi/content/abstract/ijoc.1090.0373v1">IJOC Site</A>
<BR><A HREF="papers/Abhishek-Leyffer-Linderoth-08.pdf">Preprint</A>
<BR><BR>
<LI>
O. Gunluk and J. T. Linderoth, "Perspective Relaxation of Mixed
Integer Nonlinear Programs with Indicator Variables," <I>
Mathematical Programming, Series B</I>, Vol. 104, pp. 183-206, 2010.
<BR><A HREF="http://www.springerlink.com/content/e1112k7ll1817004/">Math
Programming Site</A>
<BR><A HREF="papers/Gunluk-Linderoth-09-TR.pdf">Tech Report</A>
<BR><BR>
<LI>
K. Abhishek, S. Leyffer, and J. T. Linderoth, "Modeling without
Categorical Variables: A Mixed-Integer Nonlinear Program for the
Optimization of Thermal Insulation Systems," <I>Optimization and
Engineering</I>, Vol. 11, pp. 185-212, 2010.
<BR><A HREF="http://www.springerlink.com/content/c39678r5615h4500/">OPTE Site</A>
<BR><A HREF="papers/Abhishek-Leyffer-Linderoth-07.pdf">Preprint</A>
<BR><BR>
<LI>
J. Linderoth, F. Margot, and G. Thain, "Improving Bounds on the
Football Pool Problem via Symmetry Reduction and High-Throughput
Computing," <I>INFORMS Journal on Computing</I>, Vol. 21, pp. 445-457,
2009
<BR><A HREF="http://joc.journal.informs.org/cgi/content/abstract/21/3/445">IJOC Site</A>
<BR><A HREF="papers/Linderoth-Margot-Thain-07-TR-2.pdf">Tech Report</A>
<BR><BR>
<LI>
W. Glankwamdee, J. Linderoth, J. Shen, P. Connard, and J. Hutton,
"Combining Optimization and Simulation for Strategic and Operational
Industrial Gas Production and Distribution," <I>Computers and
Chemical Engineering</I>, Vol. 32, Issue 11, pp. 2536-2546, 2008.
<BR><A HREF="papers/Glankwamdee-Et-Al-07-TR.pdf">Tech Report</A><BR><BR>
<LI>
U. Janjarassuk and J. T. Linderoth, "Reformulation and Sampling to
Solve a Stochastic Network Interdiction Problem", <I>Networks</I>,
Volume 52, Issue 3, pp. 120-132, 2008.
<BR><A HREF="http://onlinelibrary.wiley.com/doi/10.1002/net.20237/abstract">Networks Site</A>
<BR><A HREF="papers/Janjarassuk-Linderoth-06-TR.pdf">Tech Report</A><BR><BR>
<LI>
J. T. Linderoth, A. Shapiro, and S. J. Wright, ``The Empirical Behavior of
Sampling Methods for Stochastic Programming'', <I>Annals of Operations
Research</I>, Vol. 142, pp. 219-245, 2006.
<BR><A HREF="papers/Linderoth-Shapiro-Wright-06.pdf">Paper</A>
<BR><BR>
<LI>
J. T. Linderoth, ``A Simplicial Branch-and-Bound Algorithm for Solving
Quadratically Constrained Quadratic Programs'', <I>Mathematical
Programming, Series B</I>, Vol. 103, pp. 251-282, 2005.
<BR><A HREF="papers/Linderoth-05.pdf">Paper</A>
<BR><BR>
<LI>
J. T. Linderoth and S. J. Wright, "Implementing a Decomposition
Algorithm for Stochastic Programming on a Computational Grid,"
<I> Computational Optimization and Applications</I>, Vol. 24
pp. 207-250, 2003.
<BR><A HREF="http://www.math.ufl.edu/~hager/coap/Best/"><STRONG>COAP Best Paper of 2003</STRONG></A>
<BR><A HREF="papers/Linderoth-Wright-03.pdf">Paper</A>
<BR><BR>
<LI>
K. Anstreicher and N. Brixius and J.-P. Goux and J. T. Linderoth,
"Solving Large Quadratic Assignment Problems on Computational
Grids," <I> Mathematical Programming, Series B</I>, Vol. 91,
pp. 563-588, 2002.
<BR><A
HREF="http://www.siam.org/prizes/sponsored/siagopt.php"><STRONG>2002 SIAM Activity Group on Optimization Prize</STRONG></A>
<BR><A HREF="papers/Anstreicher-Et-Al-02.pdf">Paper</A>
<BR><BR>
<LI>
P. Bauer, J. T. Linderoth, and M. W. P. Savelsbergh, "A Branch and
Cut Approach to the Cardinality Constrained Circuit Problem,"
<I>Mathematical Programming</I>, Vol. 9m pp. 307-348, 2002.
<BR><A HREF="papers/Bauer-Linderoth-Savelsbergh-02.pdf">Paper</A>
<BR><BR>
<LI>
J. T. Linderoth, E. K. Lee, and M. W. P. Savelsbergh, "A
Parallel, Linear Programming Based Heuristic for Large Scale Set
Partitioning Problems," <I> INFORMS Journal on Computing</I>, Vol. 13,
pp. 191-209, 2001.
<BR><A HREF="papers/Linderoth-Lee-Savelsbergh-01.pdf">Paper</A>
<BR><BR>
<LI>
J.-P Goux, S. Kulkarni, J. T. Linderoth, and M. E. Yoder,
``Master-Worker: An Enabling Framework for Applications
on the Computational Grid'', <I>Cluster Computing</I>, Vol. 4,
pp. 63-70, 2001.
<BR><A HREF="papers/Goux-Et-Al-00-PP-1.pdf">Preprint</A>
<BR><BR>
<LI>
Q. Chen, M. Ferris, and J. T. Linderoth, "FATCOP 2.0: Advanced
Features in an Opportunistic Mixed Integer Programming Solver,"
<I>Annals of Operations Research</I> Vol. 103, pp. 17-32, 2001.
<BR><A HREF="papers/Chen-Ferris-Linderoth-01.pdf">Paper</A>
<BR><BR>
<LI>
A. Atamturk, E. L. Johnson, J. T. Linderoth and
M. W. P. Savelsbergh, "A Relational Modeling System for Linear and
Integer Programming," <I>Operations Research</I>, Vol. 48, pp.846-857,
2000.
<BR><A HREF="papers/Atamturk-Et-Al-00.pdf">Paper</A>
<BR><BR>
<LI>
J. T. Linderoth and M. W. P. Savelsbergh, "A Computational Study of
Branch and Bound Search Strategies for Mixed Integer Programming,"
<I>INFORMS Journal on Computing</I>, Vol. 11, pp. 173-187, 1999.
<BR><A HREF="papers/Linderoth-Savelsbergh-99.pdf">Paper</A>
<BR><BR>
</UL>
<h3>Book Chapters</h3>
<UL>
<LI>
O. Gunluk and J. T. Linderoth, "Perspective Reformulation and
Applications," <I>IMA Volumes in Mathematics and its Applications</I>, 154:61-92, 2012.
<BR><A HREF="http://www.springer.com/mathematics/analysis/book/978-1-4614-1926-6">Publisher Site</A>
<BR><A HREF="papers/Gunluk-Linderoth-10.pdf">Preprint</A>
<BR><BR>
<LI>
P. Bonami, M. Kilinc, and J. T. Linderoth, "Algorithms and
Software for Solving Convex Mixed Integer Nonlinear Programs,"
<I>IMA Volumes in Mathematics and its Applications</I>, 154:1-40, 2012.
<BR><A HREF="http://www.springer.com/mathematics/analysis/book/978-1-4614-1926-6">Publisher Site</A>
<BR><A HREF="papers/Bonami-Kilinc-Linderoth-10.pdf">Preprint</A>
<BR><BR>
<LI>
P. Bonami, J. Linderoth, and A. Lodi, "Disjunctive Cuts for
Mixed Integer Nonlinear Programming Problems," Chapter 18 in
<I>Progress in Combinatorial Optimization</I>, ISTe-Wiley, 521-541, 2012.
<BR><A HREF="http://www.wiley.com/WileyCDA/WileyTitle/productCd-1848212062.html">Publisher Site</A>
<BR><A HREF="papers/Bonami-Linderoth-Lodi-12-TR.pdf">Preprint</A>
<BR><BR>
<LI>
A. Lodi and J. T. Linderoth, "MILP Software," <I>
Encyclopedia for Operations Research and Management Science</I>,
Wiley, 3239-3248, 2011. <BR><A HREF="papers/Linderoth-Lodi-10.pdf">Preprint</A>
<BR><BR>
<LI>
W. Glankwamdee and J. T. Linderoth, ``MW: A Software Framework for
Combinatorial Optimization on Computational Grids,'' E. Talbi,
(ed). <I>Parallel Combinatorial Optimization</I>, John Wiley &
Sons, 239-261, 2006.
<BR><A HREF="papers/Glankwamdee-Linderoth-05-TR.pdf">Tech Report</A>
<BR><BR>
<LI>
J. T. Linderoth and T. K. Ralphs, "Noncommercial Software for
Mixed-Integer Linear Programming", J. Karlof (ed). <I>Integer
Programming: Theory and Practice</I>, CRC Press Operations Research
Series, 2005, 253-303.
<BR><A HREF="papers/Linderoth-Ralphs-05-TR.pdf">Tech Report</A>
<BR><BR>
<LI>
J. T. Linderoth and S. J. Wright, "Computational Grids for Stochastic
Programming," S. Wallace and W. Ziemba (eds). <I>Applications of Stochastic
Programming</I>, SIAM Mathematical Series on Optimization, 2005, 61-77.
<BR><A HREF="papers/Linderoth-Wright-05-PP.pdf">Preprint</A>
<BR><BR>
</UL>
<h3>Conference Proceedings</h3>
<UL>
<LI>
V. Sawkmie and J. Linderoth, "Flexible Resource Job Scheduling---A Mixed Integer Programming Approach," <I>Proceedings of the INFORMS Optimization Society Conference</I>, 2024.
<BR> <A HREF="papers/Sawkmie-Linderoth-IOS-24.pdf">PDF</A>
<BR><BR>
</LI>
<LI>
Z. Ma and J. Linderoth, "Branching in the Dual Decomposition Method for Stochastic Integer Programs," <I>Proceedings of the INFORMS Optimization Society Conference</I>, 2024.
<BR> <A HREF="papers/Ma-Linderoth-IOS-24.pdf">PDF</A>
<BR><BR>
</LI>
<LI>A. Del Pia, J. Linderoth, and H. Zhu, "New Classes of Facets for Complementarity Knapsack Problems," <I>ISCO 2022: International Symposium on Combinatorial Optimization, Lecture Notes in Computer Science</I>, Vol. 13526, Springer, 3-21, 2022.
<BR><A HREF="https://doi.org/10.1007/978-3-031-18530-4_1">Publisher Site</A>
<BR><BR>
</LI>
<LI>A. Del Pia, J. Linderoth, and H. Zhu, "On the Complexity of Separation From the Knapsack Polytope," <I>IPCO 2022: The 23nd Conference on Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science</I>, Vol. 13265, Springer, 2022.
<BR><A HREF="https://doi.org/10.1007/978-3-031-06901-7_13">Publisher Site</A>
<BR><BR>
</LI>
<LI> A. Soni, J. Linderoth, J. Luedtke, and D. Pimentel-Alarcon, "Integer Programming Approaches To Subspace Clustering With Missing Data," <I>OPT2021: 13th Annual Workshop on Optimization for Machine Learning</I>, 2021
<BR><A HREF="https://opt-ml.org/papers/2021/paper9.pdf">Paper</A>
<BR><BR>
</LI>
<LI>A. Del Pia, J. Linderoth, and H. Zhu, "Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets,"
<I>IPCO 2021: The 22nd Conference on Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science</I>, Vol. 12707, Springer, 193-207, 2021.
<BR><A HREF="https://link.springer.com/chapter/10.1007/978-3-030-73879-2_14">Publisher Site</A>
<BR><A HREF="https://doi.org/10.48550/arXiv.2203.02873">arXiv</A>
<BR><BR>
</LI>
D. Bowman, Z. Swiecki, Z. Cai, Y. Wang, B. Eagan, J. Linderoth,
D. Williamson Shaffer and A. Ruis, "The Mathematical Foundations of
Epistemic Network Analysis," Second International Conference on
Quantitative Ethnograph (ICQE) 2021, <I>Communications in Computer and Information Science</I>, Vol. 1312, 91-105, 2021.
<BR><A HREF="https://link.springer.com/chapter/10.1007/978-3-030-67788-6_7">Publisher Site</A>
<BR><BR>
<LI>
P. Ohmann, D. Bingham Brown, N. Neelakandan, J. Linderoth, and
B. Liblit, "Optimizing Customized Program Coverage",
<I> 31st IEEE/ACM International Conference on Automated Software
Engineering (ASE 2016)</I>, 27-38, 2016.
<BR><A HREF="http://dl.acm.org/citation.cfm?id=2970351">ACM Site</A>
<BR><BR>
<LI> C. Lim, J. Linderoth, and J. Luedtke, "Valid Inequalities for
Separable Concave Constraints with Indicator Variables", <I>
IPCO 2016: The Eighteenth Conference on Integer Programming and
Combinatorial Optimization</I>, <I>Lecture Notes in Computer
Science</I>, Vol. 9682, Springer, 275-286, 2016.
<BR><A HREF="http://www.optimization-online.org/DB_HTML/2015/11/5218.html">Preprint at Optimization Online</A>
<BR><BR>
N. Cho and J.T. Linderoth, "Row-Partition Branching for Set
Partitioning Problems," <I>Proceedings of the INFORMS
Computing Society Meeting</I>, 2015.
<BR><A HREF="papers/Cho-Linderoth-15.pdf">Publication</A>
<BR><BR>
<LI> H. Dong and J. T. Linderoth, "On Valid Inequalities for
Quadratic Programming with Continuous Variables and Binary
Indicators," <I> IPCO 2013: The Sixteenth Conference on Integer
Programming and Combinatorial Optimization</I>, <I>Lecture Notes in Computer
Science</I>, Vol. 7801, Springer, 169-180, 2013.
<BR><A HREF="papers/Dong-Linderoth-12-PP.pdf">Preprint</A>
<BR><BR>
<LI>H. Shojaei, A. Davoodi, and J. T. Linderoth, "Planning for
Local Net Congestion in Global Routing", <I>ISPD: The
International Symposium on Physical Design</I>, 85-92, 2013.
<BR><A HREF="papers/Shojaei-Davoodi-Linderoth-13-PP.pdf">Preprint</A>
<BR><BR>
<LI> H. Shojaei, A. Davoodi, and J. T. Linderoth , "Congestion
Analysis for Global Routing via Integer Programming," <I>
International Conference on Computer-Aided Design (ICCAD)</I>,
256-262, 2011.
<BR><A HREF="papers/Shojaei-Davoodi-Linderoth-11-PP.pdf">Preprint</A>
<BR><BR>
<LI>
C. D'Ambrosio, J. T. Linderoth, and J. Luedtke, "Valid
Inequalities for the Pooling Problem with Binary Variables," <I>
IPCO 2011: The Fifteenth Conference on Integer Programming and
Combinatorial Optimization</I>, <I>Lecture Notes in Computer
Science</I>, Vol. 6655, Springer, 117-129, 2011.
<BR><A HREF="papers/DAmbrosio-Linderoth-Luedtke-10-TR.pdf">Tech Report</A>
<BR><BR>
<LI>
G. Nannicini, P. Belotti, J. Lee, J. Linderoth, F. Margot, and
A. Wachter, "A Probing Algorithm for MINLPs With Early
Detection of Failures by SVM," <I>CPAIOR 2011: The 8th
International Conference on Integration of Artificial Intelligence
and Operations Research</I>, <I>Lecture Notes in Computer
Science</I>, Vol. 6697, Springer, 154-169, 2011.
<BR><A HREF="papers/Nannicini-Et-Al-11-TR.pdf">Tech Report</A>
<BR><BR>
<LI>
T. Wu, A. Davoodi, and J. T. Linderoth, "Power-driven global
routing for MSV domains,"
<I>Proceedings of Design, Automation and Test in Europe (DATE
'11)</I>, 443-448, 2011.
<BR><A HREF="papers/Wu-Davoodi-Linderoth-11.pdf">Paper</A>
<BR><BR>
<LI>
W. Glankwamdee and J. T. Linderoth, "Lookahead Branching for Mixed
Integer Programming," <I>Proceedings of the Twelfth INFORMS
Computing Society Meeting</I>, 130-150, 2011.
<BR><A HREF="papers/Glankwamdee-Linderoth-11-PP.pdf">Preprint</A>
<BR><BR>
<LI>
T. Wu, A. Davoodi, and J. T. Linderoth, "A Parallel Integer
Programming Approach to Global Routing," <I>Proceedings of the
47th Design Automation Conference</I>, 194-199, 2010. <STRONG>Best
paper nominee</STRONG>.
<BR><A HREF="papers/Wu-Davoodi-Linderoth-10-2-PP.pdf">Preprint</A>
<BR><BR>
<LI>
T. Wu, A. Davoodi, and J. T. Linderoth, "GRIP: Scalable ILP for 3D
Global Routing," <I>Proceedings of the 46th Design Automation
Conference</I>, pp. 320-325, 2009.
<BR><A HREF="papers/Wu-Davoodi-Linderoth-09.pdf">Paper</A>
<BR><BR>
<LI>
J. Ostrowski, J. Linderoth, F. Rossi, and S. Smriglio, "Constraint
Orbital Branching," <I>IPCO 2008: The Thirteenth Conference on Integer
Programming and Combinatorial Optimization, Lecture Notes in Computer
Science</I>, Vol. 5035, pp. 225-239, 2008.
<BR><A HREF="papers/Ostrowski-Et-Al-07-TR.pdf">Tech Report</A>
<BR><BR>
<LI>
O. Gunluk and J. T. Linderoth, "Perspective Relaxation of Mixed
Integer Nonlinear Programs with Indicator Variables",
<I>IPCO 2008: The Thirteenth Conference on Integer Programming and
Combinatorial Optimization, Lecture Notes in Computer Science</I>,
Vol. 5035, pp. 1-16, 2008.
<BR><A HREF="papers/Gunluk-Linderoth-07.pdf">preprint</A>
<BR><BR>
<LI>
J. Ostrowski, J. T. Linderoth, F. Rossi, and S. Smirglio,
"Orbital Branching", <I>IPCO 2007: The Twelfth Conference on Integer
Programming and Combinatorial Optimization, Lecture Notes in Computer
Science</I>, Vol. 4517, pages 104-118, 2007.
<BR><A HREF="papers/Ostrowski-Et-Al-07.pdf">Paper</A>
<BR><BR>
<LI>
J.-P Goux, S. Kulkarni, J. T. Linderoth, and M. E. Yoder, "An
Enabling Framework for Master-Worker Applications on the Computational
Grid," <I>Proceedings of the Ninth IEEE International Symposium on
High Performance Distributed Computing</I>, pp. 43-50, 2000.
<BR><A HREF="papers/Goux-Et-Al-00-PP-2.pdf">Preprint</A>
<BR><BR>
</UL>
<h3>Old Technical Reports</h3>
<UL>
<!--
<LI> D. Shi, A. Davoodi, J. Linderoth, "Incremental Global Routing
for Improved Routability," Submitted, 2013.
<BR><BR>
-->
<!--
\item O. Alagoz, M. Ayvaci, and J. T. Linderoth, ``Optimally Solving
Markov Decision Processes with Total Expected Discounted Reward
Function: Linear Programming Revisited'', Submitted.
-->
<LI>
J. Linderoth, F. Margot, and G. Thain, "The Tera-Gridiron:
A Natural Turf for High-Throughput Computing," Technical Report 07T-001,
Industrial and Systems Engineering, Lehigh University, 2007.
<BR><A HREF="papers/Linderoth-Margot-Thain-07-TR-1.pdf">Tech Report</A>
<BR><BR>
<LI>
Clara Novoa, Rosemary Berger, Jeff Linderoth, and Robert Storer, "A
Set-Partitioning-Based Model for the Stochastic Vehicle Routing
Problem", Technical Report 06T-008, Industrial and Systems
Engineering, Lehigh University, 2006.
<BR><A HREF="papers/Novoa-Et-Al-06-TR.pdf">Tech Report</A>
<BR><BR>
<!--
<LI>
Wasu Glankwamdee and Jeff Linderoth, "Lookahead Branching for Mixed
Integer Programming", Technical Report 06T-004, Industrial and Systems
Engineering, Lehigh University, 2006.
<BR><A HREF="papers/Glankwamdee-Linderoth-06-TR.pdf">Tech Report</A>
<BR><BR>
-->
<LI>
J.-P Goux, J. T. Linderoth, and M. E. Yoder, "Metacomputing and the
Master-Worker Paradigm," Preprint ANL/MCS-P792-0200, Mathematics and
Computer Science Division, Argonne National Laboratory, 2000.
<BR><A HREF="papers/Goux-Linderoth-Yoder-00.pdf">Preprint</A>
<BR><BR>
<LI>
J. T. Linderoth and S. A. Burns, "Performance of Simulated Annealing
as a Circuit Placement Optimization Method," UIUC Department of
General Engineering Report 91-04, UIL U-ENG-91-3206, 1991.
</LI>
</UL>
<h3>Other</h3>
<UL>
<LI>
H. Dong, K. Chen, and J. Linderoth, "Regularization vs. Relaxation: A Conic Optimization Perspective of Statistical Variable Selection", Submitted, 2015.
<BR><A HREF="http://www.optimization-online.org/DB_HTML/2015/05/4932.html">Preprint at Optimization Online</A>
<BR><BR>
</LI>
<LI>
J. Chen, C. Lim, P. Qian, J. Linderoth, and S. J. Wright,
"Validating Sample Average Approximation Solutions with Negatively
Dependent Batches", Submitted, 2014
<BR>
<A HREF="http://www.optimization-online.org/DB_HTML/2014/04/4329.html">Preprint
at Optimization Online</A>
<BR><BR>
</LI>
<LI>
S. Leyffer, J. T. Linderoth, J. Luedtke, A. Miller, and T. Munson,
"Applications and Algorithms for Mixed Integer Nonlinear Programming,"
<I>Journal of Physics: Conference Series</I>, Vol. 180, 2009.
<BR><A HREF="papers/Leyffer-Et-Al-09.pdf">Preprint</A>
<BR><BR>
<LI>
J. T. Linderoth, <I>Topics in Parallel Integer Optimization</I>, PhD
Thesis, Georgia Institute of Technology, 1998.
<BR><A HREF="papers/Linderoth-98.pdf">(PDF)</A>
<BR><BR>
<LI>
L. Clarke, J. T. Linderoth, E. L. Johnson, G. L. Nemhauser, R.
Bhagavan, and M. Jordan, "Using OSL to Improve the Computational
Results of a MIP Logistics Model," <I>EKKNEWS</I>, 16 (1995).
<BR><A HREF="papers/Clarke-Et-Al-96.pdf">(PDF)</A>
<BR><BR>
</UL>
</FONT>
</p>
</body>
</html>