go
back to Mark Lewis homepageResearch Interests
Optimization, Modeling, Networks, Telecommunications, Algorithms, Simulation
Vita (update in progress)
Papers
,
"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.
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.
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.
Mark W. Lewis, "Using Guided Design Search in Fixed Charge Capacitated Multicommodity Network Design," in revise & resubmit Networks, April 2005.
Lewis, M.W., 2004.
"Guided Design Search as a Decision
Support Tool in Network Design", Academy of Information and Management
Science, Vol. 8 (2005).
Lewis, M.W., Karen R. Lewis, Barbara J.
White. 2004. Guided Design Search in the Interval Bounded Sailor
Assignment Problem. University of
Mississippi, Hearin Center Technical Report HCES-04-04 (to appear in
Computers and Operations Research, available on-line December 2004).
The
Hearin Center for Enterprise
Science
has additional collections of
publications.
Data Sets
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."
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 :
# of probs
# of variables # of iterations
# of variables # of nonzeros in the
following list
for example:
1 1000 10000
1000 985559
1 15 -59
...
go
back to Mark Lewis homepage
Last Update: 06/16/2005 02:54:51 PM