Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Secretary and online matching problems with machine learned advice: Label: en
Maximizing the Mostar index for bipartite graphs and split graphs: Label: en
Graphs with equal Grundy domination and independence number: Label: en
Reachability in choice networks: Label: en
The polytope of binary sequences with bounded variation: Label: en
EPTAS for load balancing problem on parallel machines with a non-renewable resource: Label: en
The complexity of 2-vertex-connected orientation in mixed graphs: Label: en
Minimum gradation in greyscales of graphs: Label: en
On the Rényi-Ulam game with restricted size queries: Label: en
Approximating single- and multi-objective nonlinear sum and product knapsack problems: Label: en
When greedy gives optimal: a unified approach: Label: en
Parametric matroid interdiction: Label: en
Tighter bounds on the minimum broadcast time: Label: en
On polytopes with linear rank with respect to generalizations of the split closure: Label: en
Characterizing linearizable QAPs by the level-1 reformulation-linearization technique: Label: en
Principled deep neural network training through linear programming: Label: en
Constraint Programming: Label: en
Computational Integer Programming and Cutting Planes: Label: en
On the History of Combinatorial Optimization (Till 1960): Label: en
Covering problems in edge- and node-weighted graphs: Label: en
New deterministic algorithms for solving parity games: Label: en
An improved zig zag approach for competitive group testing: Label: en
Go-MOCE: greedy order method of conditional expectations for Max Sat: Label: en
Node-based valid inequalities for the optimal transmission switching problem: Label: en
A column generation approach to the discrete barycenter problem: Label: en
Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem: Label: en
CHAMP: a multipass algorithm for Max Sat based on saver variables: Label: en
The \(p\)-center problem under locational uncertainty of demand points: Label: en
The \(A_\alpha\)-spectral radius of nonregular graphs (digraphs) and maximum degree (outdegree): Label: en
A polyhedral study of lifted multicuts: Label: en
Constant factor approximation for tracking paths and fault tolerant feedback vertex set: Label: en
An improved greedy algorithm for stochastic online scheduling on unrelated machines: Label: en
Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs: Label: en
Packing strong subgraph in digraphs: Label: en
The \((d-2)\)-leaky forcing number of \(Q_d\) and \(\ell\)-leaky forcing number of \(GP(n,1)\): Label: en
Block-structured integer programming: can we parameterize without the largest coefficient?: Label: en
Cardinality constrained connected balanced partitions of trees under different criteria: Label: en
A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem: Label: en
Parameterized algorithms for generalizations of directed feedback vertex set: Label: en
Stable allocations and partially ordered sets: Label: en
Preface: Quadratic combinatorial optimization problems: Label: en
Preface: Optimization and discrete geometry: Label: en
The bipartite Boolean quadric polytope: Label: en
Computational study of a branching algorithm for the maximum \(k\)-cut problem: Label: en
Submodular reassignment problem for reallocating agents to tasks with synergy effects: Label: en
Approximate separable multichoice optimization over monotone systems: Label: en
Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean dispersion problem: Label: en
\texttt{EXPEDIS}: an exact penalty method over discrete sets: Label: en
Complexity of training ReLU neural network: Label: en
A two-phase tabu search based evolutionary algorithm for the maximum diversity problem: Label: en