Discrete Optimization

Papers
(The median citation count of Discrete Optimization is 0. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-02-01 to 2024-02-01.)
ArticleCitations
Complexity of training ReLU neural network24
Single-machine scheduling with maintenance activities and rejection18
Penalty and partitioning techniques to improve performance of QUBO solvers16
Integer programming in parameterized complexity: Five miniatures9
Hardness results for Multimarginal Optimal Transport problems8
EXPEDIS: An exact penalty method over discrete sets7
A maximum edge-weight clique extraction algorithm based on branch-and-bound6
Extended formulations for convex hulls of some bilinear functions6
Linear-time algorithms for finding Hamiltonian and longest (6
A cut-and-branch algorithm for the Quadratic Knapsack Problem6
An exact cutting plane method for k-submodular function maximizatio5
A two-phase tabu search based evolutionary algorithm for the maximum diversity problem5
On the Balanced Minimum Evolution polytope5
Improved algorithms for two-agent scheduling on an unbounded serial-batching machine5
On bin packing with clustering and bin packing with delays5
Separation of cycle inequalities in periodic timetabling5
On the edge capacitated Steiner tree problem5
Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan5
The Bipartite Boolean Quadric Polytope4
The Aα4
Principled deep neural network training through linear programming4
Capacitated Multi-Layer Network Design with Unsplittable Demands: Polyhedra and Branch-and-Cut4
BDD-based optimization for the quadratic stable set problem4
Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint3
Strong IP formulations need large coefficients3
Network reliability in hamiltonian graphs3
Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes3
The stable marriage problem with ties and restricted edges3
The Arc-Item-Load and Related Formulations for the Cumulative Vehicle Routing Problem2
An improved zig zag approach for competitive group testing2
Minimum energy configurations on a toric lattice as a quadratic assignment problem2
Packing strong subgraph in digraphs2
Block-structured integer programming: Can we parameterize without the largest coefficient?2
Quality of equilibria for selfish bin packing with cost sharing variants2
A convex cover for closed unit curves has area at least 0.12
Arc-routing for winter road maintenance2
Fast constructive and improvement heuristics for edge clique covering2
A column generation approach to the discrete barycenter problem2
A polyhedral study of lifted multicuts1
Probabilistic characterization of random Max r-Sat1
Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean dispersion problem1
The nestedness property of the convex ordered median location problem on a tree1
Approximating single- and multi-objective nonlinear sum and product knapsack problems1
Fashion game on graphs1
Exact values of defective Ramsey numbers in graph classes1
Node-based valid inequalities for the optimal transmission switching problem1
GO-MOCE: Greedy Order Method of Conditional Expectations for Max Sat1
On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes1
Stable allocations and partially ordered sets1
The p-center problem under locational uncertainty of demand points1
Constant factor approximation for tracking paths and fault tolerant feedback vertex set1
On the intrinsic volumes of intersections of congruent balls1
Packing mixed hyperarborescences1
Parallelization of a branch-and-bound algorithm for the maximum weight clique problem1
Circuit walks in integral polyhedra1
Facets of the dynamic monopoly polytope: Linear ordering formulation1
Disjoint dominating and 2-dominating sets in graphs1
Cardinality constrained connected balanced partitions of trees under different criteria1
On inequalities with bounded coefficients and pitch for the min knapsack polytope1
On optimal randomized group testing with one defective item and a constrained number of positive responses1
Linear programming based approximation for unweighted induced matchings—Breaking the Δ1
Mathematical formulations and solution methods for the uncapacitated r1
Graphs with equal Grundy domination and independence number0
Editorial Board0
LP-based approximation for uniform capacitated facility location problem0
A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem0
Tighter bounds on the minimum broadcast time0
Editorial Board0
Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, polyhedral analysis and Branch-and-Cut0
The maximum number of short paths in a Halin graph0
Avoiding redundant columns by adding classical Benders cuts to column generation subproblems0
Spectral aspects of symmetric matrix signings0
On cut polytopes and graph minors0
Scheduling split intervals with non-uniform demands0
Approximate separable multichoice optimization over monotone systems0
Editorial Board0
Editorial Board0
EPTAS for load balancing problem on parallel machines with a non-renewable resource0
Preface: Optimization and Discrete Geometry0
When greedy gives optimal: A unified approach0
Tight bounds on the relative performances of pricing optimization mechanisms in storable good markets0
Parametric matroid interdiction0
Submodular reassignment problem for reallocating agents to tasks with synergy effects0
Minimum gradation in greyscales of graphs0
On the length of L-Grundy sequences0
Editorial Board0
Optimal length cutting plane refutations of integer programs0
Editorial Board0
The reach of axis-aligned squares in the plane0
On packing time-respecting arborescences0
A theoretical justification of the set covering greedy heuristic of Caprara et al.0
Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions0
Editorial Board0
The polytope of binary sequences with bounded variation0
Parameterized algorithms for generalizations of Directed Feedback Vertex Set0
Editorial Board0
Characterizing linearizable QAPs by the level-1 reformulation-linearization technique0
The k-aggregation closure for covering sets0
Editorial Board0
Minimum 0-extension problems on directed metrics0
On the general Z-type index of connected graphs0
CHAMP: A multipass algorithm for Max Sat based on saver variables0
Finding the dimension of a non-empty orthogonal array polytope0
Editorial Board0
Maximizing the Mostar index for bipartite graphs and split graphs0
The (d0
Constructing extremal triangle-free graphs using integer programming0
Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles0
On the Rényi–Ulam game with restricted size queries0
The optimal proper connection number of a graph with given independence number0
Editorial Board0
Secretary and online matching problems with machine learned advice0
The Aα0
Editorial Board0
Computational study of a branching algorithm for the maximum k-cut 0
On polytopes with linear rank with respect to generalizations of the split closure0
More on online weighted edge coloring0
Editorial Board0
Editorial Board0
Editorial Board0
Editorial Board0
On the analysis of optimization problems in arc-dependent networks0
Editorial Board0
Valid inequalities for quadratic optimisation with domain constraints0
Partial immunization of trees0
Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs0
An improved greedy algorithm for stochastic online scheduling on unrelated machines0
Rational polyhedral outer-approximations of the second-order cone0
Preface: Quadratic combinatorial optimization problems0
Reachability in choice networks0
Editorial Board0
Greedy algorithm for local heating problem0
The complexity of 2-vertex-connected orientation in mixed graphs0
Hard problems on box-totally dual integral polyhedra0
0.017550945281982