J. Cole Smith - Citegraph

Author Info

Name	Affiliation	Papers
J. COLE SMITH	Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA	57
Collaborators	Citations	PageRank
55	610	43.34
Referers	Referees	References
1072	968	682

Search Limit

1001000

Publications (57 rows)

Collaborators (55 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
An augmenting-flow algorithm for a class of node-capacitated maximum flow problems	0	0.34	2022
A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs	0	0.34	2022
On the Consistent Path Problem.	0	0.34	2020
A Survey of Network Interdiction Models and Algorithms	3	0.40	2020
In Memoriam: Shabbir Ahmed (1969–2019)	1	0.36	2019
Partial objective inequalities for the multi-item capacitated lot-sizing problem.	0	0.34	2018
Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations.	4	0.39	2018
A Backward Sampling Framework For Interdiction Problems With Fortification	3	0.42	2017
Branch-cut-price algorithms for solving a class of search problems on general graphs.	0	0.34	2017
Solving the traveling salesman problem with interdiction and fortification.	1	0.35	2017
A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem	7	0.45	2017
Dynamic shortest-path interdiction	1	0.36	2016
A mixed-integer bilevel programming approach for a competitive prioritized set covering problem.	5	0.44	2016
A survey of optimization algorithms for wireless sensor network lifetime maximization.	3	0.38	2016
A class of algorithms for mixed-integer bilevel min---max optimization	10	0.50	2016
On a Random Walk Survivability problem with arc failures and memory	0	0.34	2015
A branch-and-price-and-cut method for computing an optimal bramble	0	0.34	2015
Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems	9	0.49	2015
Algorithms for an Integer Multicommodity Network Flow Problem with Node Reliability Considerations	4	0.41	2014
A cutting-plane algorithm for solving a weighted influence interdiction problem	4	0.46	2014
Convex hull representation of the deterministic bipartite network interdiction problem	4	0.42	2014
Distributed Algorithm for Lifetime Maximization in a Delay-Tolerant Wireless Sensor Network with a Mobile Sink	36	1.09	2013
A decomposition approach for solving a broadcast domination network design problem.	1	0.36	2013
Integer programming models and algorithms for the graph decontamination problem with mobile agents	3	0.42	2013
Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs.	2	0.37	2012
Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks	6	0.48	2012
A combinatorial optimization algorithm for solving the branchwidth problem	2	0.37	2012
Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs	35	1.35	2012
Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures.	4	0.46	2012
Exact interdiction models and algorithms for disconnecting networks via node deletions.	38	1.46	2012
Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths	10	0.53	2010
Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning	15	0.77	2010
Cutting plane algorithms for solving a stochastic edge-partition problem	3	0.41	2009
A Dynamic Programming Algorithm for the Generalized Minimum Filter Placement Problem on Tree Structures	0	0.34	2009
An exact reformulation-linearisation technique algorithm for solving a parameter extraction problem arising in compact thermal models	1	0.37	2009
Two-stage stochastic hierarchical multiple risk problems: models and algorithms	7	0.47	2009
Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network	12	0.82	2009
Branch-and-price-and-cut algorithms for solving the reliable h-paths problem	8	0.54	2008
Mathematical Programming Algorithms For Two-Path Routing Problems With Reliability Considerations	11	0.60	2008
Survivable network design under optimal and heuristic interdiction scenarios	23	1.37	2007
On the multi-attribute stopping problem with general value functions	1	0.37	2007
A packet filter placement problem with application to defense against spoofed denial of service attacks	9	0.61	2007
A bracket assignment problem for the National Collegiate Athletic Association Men's Basketball Tournament	2	0.39	2006
A polyhedral study of the generalized vertex packing problem	7	0.88	2006
Sequential Search with Multiattribute Options	8	0.84	2006
Dynamic programming algorithms for the conditional covering problem on path and extended star graphs	4	0.50	2005
A dynamic programming algorithm for the conditional covering problem on tree graphs	3	0.49	2005
An Analysis of the Alias Method for Discrete Random-Variate Generation	5	0.60	2005
A class of web-based facets for the generalized vertex packing problem	2	0.37	2005
Interleaving two-phased jobs on a single machine	8	1.11	2005

1
2
50 / page