Mark Lewis

910 total citations · 1 hit paper
21 papers, 520 citations indexed

About

Mark Lewis is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Industrial and Manufacturing Engineering. According to data from OpenAlex, Mark Lewis has authored 21 papers receiving a total of 520 indexed citations (citations by other indexed papers that have themselves been cited), including 7 papers in Computer Networks and Communications, 7 papers in Computational Theory and Mathematics and 6 papers in Industrial and Manufacturing Engineering. Recurrent topics in Mark Lewis's work include Optimization and Packing Problems (5 papers), Optimization and Search Problems (4 papers) and VLSI and FPGA Design Techniques (4 papers). Mark Lewis is often cited by papers focused on Optimization and Packing Problems (5 papers), Optimization and Search Problems (4 papers) and VLSI and FPGA Design Techniques (4 papers). Mark Lewis collaborates with scholars based in United States, China and South Africa. Mark Lewis's co-authors include Fred Glover, Gary Kochenberger, Haibo Wang, Jin‐Kao Hao, Zhipeng Lü, Yang Wang, Amit Verma, Bahram Alidaee, John Naylor and Jeffery L. Kennington and has published in prestigious journals such as European Journal of Operational Research, Computers & Operations Research and Long Range Planning.

In The Last Decade

Mark Lewis

20 papers receiving 500 citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

The unconstrained binary quadratic programming problem: a survey

2014 262 citations Gary Kochenberger, Jin‐Kao Hao et al. Journal of Combinatorial Optimization profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Mark Lewis United States	10	309	165	87	85	80	21	520
Sebastian Pokutta United States	14	133 0.4×	313 1.9×	124 1.4×	95 1.1×	117 1.5×	83	701
Kengo Katayama Japan	11	232 0.8×	155 0.9×	125 1.4×	54 0.6×	146 1.8×	42	444
Fabián A. Chudak United States	16	224 0.7×	193 1.2×	267 3.1×	95 1.1×	322 4.0×	22	779
Sergiu Rudeanu Romania	8	235 0.8×	411 2.5×	94 1.1×	61 0.7×	80 1.0×	41	699
Elizna Burger South Africa	3	79 0.3×	314 1.9×	111 1.3×	77 0.9×	53 0.7×	8	594
Illya V. Hicks United States	10	117 0.4×	214 1.3×	167 1.9×	63 0.7×	49 0.6×	44	481
John Barnes United Kingdom	11	365 1.2×	269 1.6×	190 2.2×	35 0.4×	20 0.3×	46	838
Rajeev Kumar India	12	150 0.5×	113 0.7×	70 0.8×	37 0.4×	68 0.8×	39	409
Vladimir Gurvich United States	15	196 0.6×	431 2.6×	107 1.2×	71 0.8×	28 0.3×	63	730
Armen S. Asratian Sweden	7	52 0.2×	244 1.5×	126 1.4×	111 1.3×	74 0.9×	31	533

Countries citing papers authored by Mark Lewis

Since Specialization

Citations

This map shows the geographic impact of Mark Lewis's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Mark Lewis with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mark Lewis more than expected).

Fields of papers citing papers by Mark Lewis

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Mark Lewis. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Mark Lewis. The network helps show where Mark Lewis may publish in the future.

Co-authorship network of co-authors of Mark Lewis

This figure shows the co-authorship network connecting the top 25 collaborators of Mark Lewis. A scholar is included among the top collaborators of Mark Lewis based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Mark Lewis. Mark Lewis is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Lewis, Mark, Amit Verma, & Todd T. Eckdahl. (2021). Qfold: a new modeling paradigm for the RNA folding problem. Journal of Heuristics. 27(4). 695–717. 6 indexed citations

Du, Yu, et al.. (2021). Solving Clique Partitioning Problems: A Comparison of Models and Commercial Solvers. International Journal of Information Technology & Decision Making. 21(1). 59–81. 6 indexed citations

Verma, Amit & Mark Lewis. (2020). Penalty and partitioning techniques to improve performance of QUBO solvers. Discrete Optimization. 44. 100594–100594. 39 indexed citations

Lewis, Mark, et al.. (2019). Of Spatial and Temporal Entanglements – Narrating a (Chinese) Street in Suburban Johannesburg. China Perspectives. 2019(4). 37‑43–37‑43. 1 indexed citations

Lewis, Mark, et al.. (2019). Robust optimisation of unconstrained binary quadratic problems. International Journal of Operational Research. 36(4). 441–441. 2 indexed citations

Lewis, Mark & Fred Glover. (2017). Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis. Networks. 70(2). 79–97. 55 indexed citations

Lewis, Mark & Gary Kochenberger. (2016). Probabilistic multistart with path relinking for solving the unconstrained binary quadratic problem. International Journal of Operational Research. 26(1). 13–13. 2 indexed citations

Kochenberger, Gary, Jin‐Kao Hao, Fred Glover, et al.. (2014). The unconstrained binary quadratic programming problem: a survey. Journal of Combinatorial Optimization. 28(1). 58–81. 262 indexed citations breakdown →

Lewis, Mark, Haibo Wang, & Gary Kochenberger. (2014). Exact Solutions to the Capacitated Clustering Problem: A Comparison of Two Models. Annals of Data Science. 1(1). 15–23. 7 indexed citations

10.

Lewis, Mark, et al.. (2012). SOLO: A Linear Ordering Approach to Path Analysis of Web Site Traffic. INFOR Information Systems and Operational Research. 50(4). 186–194. 2 indexed citations

11.

Lewis, Mark & Gary Kochenberger. (2010). A two-stage approach to solving large capacitated task allocation problems. International Journal of Mathematical Modelling and Numerical Optimisation. 1(4). 259–259. 1 indexed citations

12.

Lewis, Mark, Bahram Alidaee, Fred Glover, & Gary Kochenberger. (2009). A note on xQx as a modelling and solution framework for the Linear Ordering Problem. International Journal of Operational Research. 5(2). 152–152. 11 indexed citations

13.

Lewis, Mark. (2008). 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. 6 indexed citations

14.

Lewis, Mark. (2008). The diffusion of black gospel music in postmodern Denmark: with implications for evangelization, meaning construction, and Christian identity. ePlace - Preserving, Learning, and Creative Exchange (Asbury Theological Seminary). 1 indexed citations

15.

Alidaee, Bahram, et al.. (2007). A new approach for modeling and solving set packing problems. European Journal of Operational Research. 186(2). 504–512. 28 indexed citations

16.

Lewis, Mark, Gary Kochenberger, & Bahram Alidaee. (2006). A new modeling and solution approach for the set-partitioning problem. Computers & Operations Research. 35(3). 807–813. 35 indexed citations

17.

Lewis, Mark, et al.. (2004). Guided design search in the interval-bounded sailor assignment problem. Computers & Operations Research. 33(6). 1664–1680. 3 indexed citations

18.

Lewis, Mark, Bahram Alidaee, & Gary Kochenberger. (2004). Using xQx to model and solve the uncapacitated task allocation problem. Operations Research Letters. 33(2). 176–182. 14 indexed citations

19.

Kennington, Jeffery L. & Mark Lewis. (2001). The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis. INFORMS journal on computing. 13(3). 181–190. 13 indexed citations

20.

Naylor, John & Mark Lewis. (1997). Internal alliances: Using joint ventures in a diversified company. Long Range Planning. 30(5). 678–688. 17 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact