Data Sets

Capacitated Task Allocation Problem Set (coming soon)

Linear Ordering Problems (program to create Q matrix and linear program)

Set Partitioning Problems in various xQx and cplex .lp formats.  Problems 2,3,5,6,8, and 9 have solutions in their cplex .log files. 

Difficult Set Partitioning Problems with high density (% variables per column)
 

Uncapacitated Task Allocation Problems as seen in OR Letters "Modeling and Solving the Task Allocation Problem as an Unconstrained Quadratic Binary Program"
 

Fixed Charge Capacitated Multi-commodity Network Design Problem Generator creates lp-formatted text files.

Link to lp-formatted Problems used in  "Guided Design Search in the Interval Bounded Sailor Assignment Problem."

Vita

   Vita  (keywords: optimization, Guided Design Search, xQx)

Papers

Lewis, M., Alidaee, B., Glover, F., & Kochenberger, G. (in press).  A Note on xQx as a Modeling and Solution Framework for the Linear Ordering problem. International Journal of Operational Research, 4 (6).

Wang, H., Kochenberger, G., Lewis, M., Lewis, K., & Alidaee, B. (in press).  Modeling and Solving Set Packing Problems Via Unconstrained Quadratic Programming. European Journal of Operational Research.

Lewis, M., G. Kochenberger, and B. Alidaee, “A New Modeling and Solution Approach for the Set Partitioning Problem” accepted March 2006 Computers and Operations Research.

Lewis, M.W., Karen R. Lewis, Barbara J. White. "Guided Design Search in the Interval Bounded Sailor Assignment Problem".  Computers and Operations Research, Vol. 33, No 6, Jun 2006, 1664-1680.

Mark W. Lewis, Bahram Alidaee, Gary Kochenberger, "Using xQx to model and solve the uncapacitated task allocation problem," Operations Research Letters, 33 (2005) 176-182.

Lewis, M.W., 2004. "Guided Design Search as a Decision Support Tool in Network Design", Academy of Information and Management Science, Vol. 8 (2005).

Mark W. Lewis, "The Effects of Network Characteristics on Joint Capacity Optimization in Robust Telecommunications Networks,"  International Journal Of Operations and Quantitative Management, Vol. 10, No 3, Sep 2004, 1-19.

Jeffery L. Kennington, Mark W. Lewis, "The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis," INFORMS Journal on Computing, Volume: 13, Number: 3. Pgs: 0181-0190, Summer 2001.
 

My Phd advisor, Professor Jeff Kennington and I at the SMU PhD banquet, April 2000
 
From left to right, Robert Lewis, Jeffery Kennington, Karen Lewis, Mark Lewis.

Programs for solving xQx (the Unconstrained Quadratic Binary Program)
(Thanks to G. Palubeckis ( www.soften.ktu.lt/~gintares )

ms_tabu_2  (right-click and use the Save Target As ... option)  (This is the supposed best performer of the multi-starts) Command line looks like ms_tabu_2  Q_matrix.txt  out.txt print_boolean  M_penalty fixed_cost

for example, ms_tabu_2 Qgap_333.txt  out.txt  1 4000 3000

Palubeckis tabu search with no multi-start (input file is same as multi-start above except for first two lines which look like :

for example:
1 1000 10000
1000 985559
1  15  -59
...
followed by the rest of the row col value listing

Linear Ordering in Web Usage Mining References  

go back to Mark Lewis homepage

Last Update:  04/24/2008 08:20:33 PM

iq  com iq2