default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark W. Lewis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j19]Amit Verma
, Mark W. Lewis:
Penalty and partitioning techniques to improve performance of QUBO solvers. Discret. Optim. 44(Part): 100594 (2022)- [j18]Yu Du, Gary A. Kochenberger, Fred W. Glover, Haibo Wang, Mark W. Lewis, Weihong Xie, Takeshi Tsuyuguchi:
Solving Clique Partitioning Problems: A Comparison of Models and Commercial Solvers. Int. J. Inf. Technol. Decis. Mak. 21(1): 59-81 (2022) - 2021
- [j17]Mark W. Lewis, Amit Verma, Todd T. Eckdahl:
Qfold: a new modeling paradigm for the RNA folding problem. J. Heuristics 27(4): 695-717 (2021) - 2020
- [j16]Amit Verma, Mark W. Lewis:
Optimal quadratic reformulations of fourth degree Pseudo-Boolean functions. Optim. Lett. 14(6): 1557-1569 (2020) - 2018
- [j15]Fred W. Glover, Mark W. Lewis, Gary A. Kochenberger:
Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems. Eur. J. Oper. Res. 265(3): 829-842 (2018) - 2017
- [j14]Mark W. Lewis, Fred W. Glover:
Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis. Networks 70(2): 79-97 (2017) - 2015
- [j13]Gary A. Kochenberger, Mark W. Lewis, Fred W. Glover, Haibo Wang:
Exact solutions to generalized vertex covering problems: a comparison of two models. Optim. Lett. 9(7): 1331-1339 (2015) - 2014
- [j12]Gary A. Kochenberger, Jin-Kao Hao, Fred W. Glover, Mark W. Lewis, Zhipeng Lü, Haibo Wang, Yang Wang:
The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28(1): 58-81 (2014) - 2013
- [j11]Mark W. Lewis, Gary A. Kochenberger:
Graph Bisection Modeled as Cardinality Constrained Binary quadratic Task Allocation. Int. J. Inf. Technol. Decis. Mak. 12(2): 261-276 (2013) - 2012
- [j10]Mark W. Lewis, Barbara Jo White:
SOLO: A Linear Ordering Approach to Path Analysis of Web Site Traffic. INFOR Inf. Syst. Oper. Res. 50(4): 186-194 (2012) - 2010
- [j9]Mark W. Lewis, Gary A. Kochenberger:
A two-stage approach to solving large capacitated task allocation problems. Int. J. Math. Model. Numer. Optimisation 1(4): 259-273 (2010) - 2009
- [j8]Haibo Wang, Gary A. Kochenberger, Bahram Alidaee, Mark W. Lewis:
Solving the market split problem via branch-and-cut. Int. J. Math. Model. Numer. Optimisation 1(1/2): 121-127 (2009) - [j7]Bahram Alidaee, Gary A. Kochenberger, Karen R. Lewis, Mark W. Lewis, Haibo Wang:
Computationally attractive non-linear models for combinatorial optimisation. Int. J. Math. Oper. Res. 1(1/2): 9-19 (2009) - [j6]Mark W. Lewis:
On the use of guided design search for discovering significant decision variables in the fixed-charge capacitated multicommodity network design problem. Networks 53(1): 6-18 (2009) - 2008
- [j5]Mark W. Lewis, Gary A. Kochenberger, Bahram Alidaee:
A new modeling and solution approach for the set-partitioning problem. Comput. Oper. Res. 35(3): 807-813 (2008) - [j4]Bahram Alidaee, Gary A. Kochenberger, Karen R. Lewis, Mark W. Lewis, Haibo Wang:
A new approach for modeling and solving set packing problems. Eur. J. Oper. Res. 186(2): 504-512 (2008) - 2006
- [j3]Mark W. Lewis, Karen R. Lewis, Barbara Jo White:
Guided design search in the interval-bounded sailor assignment problem. Comput. Oper. Res. 33: 1664-1680 (2006) - 2005
- [j2]Mark W. Lewis, Bahram Alidaee, Gary A. Kochenberger:
Using xQx to model and solve the uncapacitated task allocation problem. Oper. Res. Lett. 33(2): 176-182 (2005) - 2001
- [j1]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 J. Comput. 13(3): 181-190 (2001)
Informal and Other Publications
- 2021
- [i10]Amit Verma, Mark W. Lewis:
Goal Seeking Quadratic Unconstrained Binary Optimization. CoRR abs/2103.12951 (2021) - [i9]Amit Verma, Mark W. Lewis:
Constraint Programming to Discover One-Flip Local Optima of Quadratic Unconstrained Binary Optimization Problems. CoRR abs/2104.01709 (2021) - [i8]Amit Verma, Mark W. Lewis:
Variable Reduction For Quadratic Unconstrained Binary Optimization. CoRR abs/2105.07032 (2021) - [i7]Mark W. Lewis, Amit Verma, Rick Hennig:
Predicting 3D RNA Folding Patterns via Quadratic Binary Optimization. CoRR abs/2106.07527 (2021) - [i6]Amit Verma, Mark W. Lewis:
QUBO transformation using Eigenvalue Decomposition. CoRR abs/2106.10532 (2021) - [i5]Amit Verma, Mark W. Lewis, Gary A. Kochenberger:
Efficient QUBO transformation for Higher Degree Pseudo Boolean Functions. CoRR abs/2107.11695 (2021) - 2017
- [i4]Fred W. Glover, Mark W. Lewis, Gary A. Kochenberger:
Logical and Inequality Implications for Reducing the Size and Complexity of Quadratic Unconstrained Binary Optimization Problems. CoRR abs/1705.09545 (2017) - [i3]Mark W. Lewis, Fred W. Glover:
Quadratic Unconstrained Binary Optimization Problem Preprocessing: Theory and Empirical Analysis. CoRR abs/1705.09844 (2017) - [i2]Mark W. Lewis:
A Diversified Multi-Start Algorithm for Unconstrained Binary Quadratic Problems Leveraging the Graphics Processor Unit. CoRR abs/1706.00037 (2017) - [i1]Mark W. Lewis, Gary A. Kochenberger, John Metcalfe:
Robust Optimization of Unconstrained Binary Quadratic Problems. CoRR abs/1709.07511 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
