Discrete Optimization

0.6(top 50%)

impact factor

632(top 20%)

papers

9.0K(top 20%)

citations

41(top 20%)

h-index

0.7(top 50%)

impact factor

753

all documents

9.6K

doc citations

73(top 20%)

g-index

Top Articles

#	Title	Journal	Year	Citations
1	An algorithmic framework for convex mixed integer nonlinear programs	Discrete Optimization	2008	622
2	Bike sharing systems: Solving the static rebalancing problem	Discrete Optimization	2013	369
3	Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning	Discrete Optimization	2016	287
4	Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints	Discrete Optimization	2006	248
5	Using mixed-integer programming to solve power grid blackout problems	Discrete Optimization	2007	149
6	A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints	Discrete Optimization	2014	144
7	Improving the feasibility pump	Discrete Optimization	2007	126
8	The two-dimensional bin packing problem with variable bin sizes and costs	Discrete Optimization	2005	124
9	An iterated local search algorithm for the time-dependent vehicle routing problem with time windows	Discrete Optimization	2008	120
10	A semidefinite optimization approach for the single-row layout problem with unequal dimensions	Discrete Optimization	2005	113
11	A feasibility pump heuristic for general mixed-integer problems	Discrete Optimization	2007	109
12	Computing robust basestock levels	Discrete Optimization	2008	106
13	When the greedy algorithm fails	Discrete Optimization	2004	105
14	Treewidth governs the complexity of target set selection	Discrete Optimization	2011	96
15	Copositive and semidefinite relaxations of the quadratic assignment problem	Discrete Optimization	2009	95
16	Inverse median problems	Discrete Optimization	2004	91
17	An exact approach for the Vertex Coloring Problem	Discrete Optimization	2011	87
18	Exact interdiction models and algorithms for disconnecting networks via node deletions	Discrete Optimization	2012	87
19	The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times	Discrete Optimization	2008	84
20	Quantum annealing of the graph coloring problem	Discrete Optimization	2011	81
21	A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives	Discrete Optimization	2010	79
22	An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem	Discrete Optimization	2009	76
23	Conflict analysis in mixed integer programming	Discrete Optimization	2007	75
24	A General VNS heuristic for the traveling salesman problem with time windows	Discrete Optimization	2010	71
25	Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs	Discrete Optimization	2004	67
26	Min-up/min-down polytopes	Discrete Optimization	2004	65
27	Lower bounds on kernelization	Discrete Optimization	2011	63
28	Two edge modification problems without polynomial kernels	Discrete Optimization	2013	59
29	Graph-based data clustering with overlaps	Discrete Optimization	2011	58
30	Near-optimal solutions to large-scale facility location problems	Discrete Optimization	2005	55
31	The inverse 1-median problem on a cycle	Discrete Optimization	2008	55
32	A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem	Discrete Optimization	2009	55
33	A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem	Discrete Optimization	2004	54
34	Metric inequalities and the Network Loading Problem	Discrete Optimization	2007	54
35	The minimum spanning tree problem with conflict constraints and its variations	Discrete Optimization	2011	53
36	Heuristic algorithms for the operator-based relocation problem in one-way electric carsharing systems	Discrete Optimization	2017	49
37	FPT algorithms for path-transversal and cycle-transversal problems	Discrete Optimization	2011	48
38	N-fold integer programming">N-fold integer programming	Discrete Optimization	2008	47
39	Global solution of optimization problems with signomial parts	Discrete Optimization	2008	46
40	k-clubs in graphs">On inclusionwise maximal and maximum cardinality k-clubs in graphs	Discrete Optimization	2012	46
41	On the complexity of cake cutting	Discrete Optimization	2007	45
42	ve-degree and ev-degree of graphs">On ve-degree and ev-degree of graphs	Discrete Optimization	2019	45
43	Facility location problems with uncertainty on the plane	Discrete Optimization	2005	43
44	Algorithms for time-dependent bicriteria shortest path problems	Discrete Optimization	2006	43
45	Stable assignment with couples: Parameterized complexity and local search	Discrete Optimization	2011	43
46	Pivot and shift—a mixed integer programming heuristic	Discrete Optimization	2004	41
47	Integral cycle bases for cyclic timetabling	Discrete Optimization	2009	40
48	A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)	Discrete Optimization	2008	39
49	A computational comparison of flow formulations for the capacitated location-routing problem	Discrete Optimization	2013	39
50	Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem	Discrete Optimization	2009	38

Scientometrics

Overviews

Citing Bodies

Discrete Optimization

Top Articles