yusuke1997/dblp-id-title huggingface dataset:
Stochastic scheduling in an in-forest
An exact solution method for quadratic matching: The one-quadratic-term technique and generalisations
Solving mirrored traveling tournament problem benchmark instances with eight teams
George Dantzig's impact on the theory of computation
A linear time algorithm for balance vertices on trees
Minimum number of below average triangles in a weighted complete graph
Conflict analysis in mixed integer programming
Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays
On compact k-edge-colorings: A polynomial time reduction from linear to cyclic
On inequalities with bounded coefficients and pitch for the min knapsack polytope
Binary quadratic optimization problems that are difficult to solve by conic relaxations
An exact cutting plane method for k-submodular function maximization
Branch decomposition heuristics for linear matroids
Some single-machine scheduling problems with elapsed-time-based and position-based learning and forgetting effects
A polynomial-time algorithm for conformable coloring on regular bipartite and subcubic graphs
Mixed-integer linear programming heuristics for the prepack optimization problem
Staircase compatibility and its applications in scheduling and piecewise linearization
Sequential pairing of mixed integer inequalities
Circuit walks in integral polyhedra
Separation of partition inequalities with terminals
Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
A pricing problem under Monge property
On the linear relaxation of the p-median problem
Parameterized complexity and approximability of the Longest Compatible Sequence problem
Lifted, projected and subgraph-induced inequalities for the representatives k-fold coloring polytope
Linear programming based approximation for unweighted induced matchings - Breaking the Δ barrier
Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
The k edge-disjoint 3-hop-constrained paths polytope
Linear optimization over permutation groups
Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean dispersion problem
A computational comparison of flow formulations for the capacitated location-routing problem
Valid inequalities for the Time-Indexed Non-Preemptive Single Machine Scheduling Problem
Preface: Optimization and Discrete Geometry
On the complexity of submodular function minimisation on diamonds
Min-up/min-down polytopes
Trimming of finite subsets of the Manhattan plane
The multi-band robust knapsack problem - A dynamic programming approach
Huge multiway table problems
The parameterized complexity of k-flip local search for SAT and MAX SAT
Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles
FPT algorithms for path-transversal and cycle-transversal problems
A new separation algorithm for the Boolean quadric and cut polytopes
Improved upper bounds for the Steiner ratio
A polyhedral study of lot-sizing with supplier selection
On the k-limited packing numbers in graphs
A polynomial time algorithm for unloading boxes off a gravity conveyor
Computation of lower tolerances of combinatorial bottleneck problems
An algorithmic framework for convex mixed integer nonlinear programs
Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
Lot-sizing with fixed charges on stocks: the convex hull
Minmax regret bottleneck problems with solution-induced interval uncertainty structure
Fleet & tail assignment under uncertainty
Valid inequalities for the single arc design problem with set-ups
Fixed-parameter algorithms for vertex cover P 3
On polytopes with linear rank with respect to generalizations of the split closure
On the integrality gap of small Asymmetric Traveling Salesman Problems: A polyhedral and computational approach
Valid inequalities for quadratic optimisation with domain constraints
Covering problems in edge- and node-weighted graphs
Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
Weighted graphs defining facets: A connection between stable set and linear ordering polytopes
Computing maximum stable sets for distance-hereditary graphs
Entropy of orthogonal matrices and minimum distance orthostochastic matrices from the uniform van der Waerden matrices
Improved bounds for vehicle routing solutions
George Dantzig's contributions to integer programming
An integer programming approach to optimal basic block instruction scheduling for single-issue processors
A new construction of I -separable matrices via an improved decoding of Macula's construction
A Special Issue in Memory of George B. Dantzig
An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
Computing robust basestock levels
Hardness results for Multimarginal Optimal Transport problems
The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature
Minimum partition of an independence system into independent sets
Exact interdiction models and algorithms for disconnecting networks via node deletions
Complexity results for Weighted Timed Event Graphs
On shortest disjoint paths in planar graphs
A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
The k-way vertex cut problem on bipartite graphs: Complexity results and algorithms
Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics
The weighted 2-metric dimension of trees in the non-landmarks model
Recognition of tractable DNFs representable by a constant number of intervals
Monoidal cut strengthening revisited
Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
Integer program with bimodular matrix
Strengthening lattice-free cuts using non-negativity
Column basis reduction and decomposable knapsack problems
The optimal proper connection number of a graph with given independence number
Anticoloring of a family of grid graphs
Balanced home-away assignments
Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators
Single-machine scheduling with maintenance activities and rejection
Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices
The Arc-Item-Load and Related Formulations for the Cumulative Vehicle Routing Problem
The one-machine just-in-time scheduling problem with preemption
An algorithm for finding a maximum t-matching excluding complete partite subgraphs
On maximizing a monotone k-submodular function subject to a matroid constraint
On the separation of split inequalities for non-convex quadratic integer programming
On dynamic monopolies of graphs: The average and strict majority thresholds
Special Issue on Parameterized Complexity of Discrete Optimization
A branch-and-cut approach to the crossing number problem
On the Balanced Minimum Evolution polytope
The (d-2)-leaky forcing number of Qd and ℓ-leaky forcing number of GP(n, 1)
The traveling salesman problem
Scheduling jobs with time-resource tradeoff via nonlinear programming
Facility location problems with uncertainty on the plane
Single-machine scheduling with positional due indices and positional deadlines
Parallelization of a branch-and-bound algorithm for the maximum weight clique problem
Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
Polarity and the complexity of the shooting experiment
The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
Solving MIPs via scaling-based augmentation
The median game
Quantum annealing of the graph coloring problem
A note on constraint aggregation and value functions for two-stage stochastic integer programs
Feasibility recovery for the Unit-capacity Constrained Permutation Problem
Complete formulations of polytopes related to extensions of assignment matrices
Computing minimum multiway cuts in hypergraphs
Minimum cycle factors in quasi-transitive digraphs
Polyhedral results on single node variable upper-bound flow models with allowed configurations
Exact algorithms for the bin packing problem with fragile objects
On the algorithmic effectiveness of digraph decompositions and complexity measures
An algorithm to increase the node-connectivity of a digraph by one
Minimum gradation in greyscales of graphs
Nonlinear bipartite matching
Improved algorithms for two-agent scheduling on an unbounded serial-batching machine
Multi-dimensional vector assignment problems
Preface: Quadratic combinatorial optimization problems
Metric inequalities for routings on direct connections with application to line planning
On complexities of minus domination
New bounds on the average distance from the Fermat-Weber center of a planar convex body
Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph
A hybrid algorithm for the unbounded knapsack problem
Strong IP formulations need large coefficients
Dual greedy polyhedra, choice functions, and abstract convex geometries
Generalizing the induced matching by edge capacity constraints
L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem
On the Rényi-Ulam game with restricted size queries
A discrete Farkas lemma
A model to optimize placement operations on dual-head placement machines
A remark on the formulation given in "A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows"
On two extensions of equimatchable graphs
Treewidth governs the complexity of target set selection
On Pareto optimal balanced exchanges
When greedy gives optimal: A unified approach
How tight is the corner relaxation?
When the greedy algorithm fails
On finitely generated closures in the theory of cutting planes
Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem
Scheduling on same-speed processors with at most one downtime on each machine
The minimum spanning tree problem with conflict constraints and its variations
Emergency path restoration problems
Dominance guarantees for above-average solutions
Fast constructive and improvement heuristics for edge clique covering
Rational polyhedral outer-approximations of the second-order cone
Shortest path algorithms for functional environments
Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem
Disjoint dominating and 2-dominating sets in graphs: Hardness and approximation results
Two-machine open shop problem with controllable processing times
Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty
Duality for a b-complementary multisemigroup master problem
Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks
Optimal length cutting plane refutations of integer programs
One more well-solved case of the multifacility location problem
On the number of independent sets in Halin graphs
On the complexity of the separation problem for rounded capacity inequalities
Constant factor approximation for tracking paths and fault tolerant feedback vertex set
Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times
Sensitivity analysis to perturbations of the weight of a subset of items: The knapsack case study
A polyhedral study of lifted multicuts
Upgrading the 1-center problem with edge length variables on a tree
Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint
Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios
On approximation of the vertex cover problem in hypergraphs
Computing Steiner points for gradient-constrained minimum networks
A Greedy Partition Lemma for directed domination
Network design with weighted degree constraints
Approximation algorithm for minimizing total latency in machine scheduling with deliveries
Scheduling split intervals with non-uniform demands
Mathematical formulations and solution methods for the uncapacitated r-allocation p-hub maximal covering problem
Note on pseudolattices, lattices and submodular linear programs
Projection results for the -partition problem
George Dantzig in the development of economic analysis
Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs
The dominance assignment problem
A Note on "Lot-sizing with fixed charges on stocks: The convex hull"
Principled deep neural network training through linear programming
Quasiabelian landscapes of the traveling salesman problem are elementary
A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
An integer optimality condition for column generation on zero-one linear programs
Recent results on well-balanced orientations
A generalization of the integer linear infeasibility problem
The hypergraph assignment problem
Graph-based data clustering with overlaps
Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope
The reach of axis-aligned squares in the plane
On the Lovász theta function and some variants
Near-optimal solutions to large-scale facility location problems
Supermodular covering knapsack polytope
A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability
Approximation algorithms for maximum latency and partial cycle cover
On the pure fixed charge transportation problem
On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes
Mixed integer programming with a class of nonlinear convex constraints
Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks
On relocation problems with multiple identical working crews
Exploiting symmetries in optimal quantum circuit design
Complexity of the min-max (regret) versions of min cut problems
On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0, 1 hypercube
Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers
Finding the dimension of a non-empty orthogonal array polytope
On the bounds for the largest Laplacian eigenvalues of weighted graphs
The Grothendieck constant of random and pseudo-random graphs
The price of anarchy for utilitarian scheduling games on related machines
Scheduling on uniform processors with at most one downtime on each machine
A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs
Labeled Traveling Salesman Problems: Complexity and approximation
Optimal partitions of the flat torus into parts of smaller diameter
Parameterized algorithms for generalizations of Directed Feedback Vertex Set
The maximum number of short paths in a Halin graph
Arc-routing for winter road maintenance
Penalty and partitioning techniques to improve performance of QUBO solvers
GO-MOCE: Greedy Order Method of Conditional Expectations for Max Sat
Sherali-Adams relaxations of graph isomorphism polytopes
Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes
The travelling preacher, projection, and a lower bound for the stability number of a graph
Minimizing maximum dissatisfaction in the allocation of indivisible items under a common preference graph
On the combinatorics of the 2-class classification problem
Parametric multiroute flow and its application to multilink-attack network
The polytope of binary sequences with bounded variation
Linear-time algorithms for finding Hamiltonian and longest (s, t)-paths in C-shaped grid graphs
Constructing extremal triangle-free graphs using integer programming
The k-path tree matroid and its applications to survivable network design
Combined route capacity and route length models for unit demand vehicle routing problems
An improved bound for the price of anarchy for related machine scheduling
On zeroth-order general Randic index of quasi-tree graphs containing cycles
Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions
Approximation schemes for Min-Sum k-Clustering
Minimum mean cycle problem in bidirected and skew-symmetric graphs
Graphs and combinatorial optimization
The nestedness property of the convex ordered median location problem on a tree
The constant objective value property for multidimensional assignment problems
Heuristic algorithms for the operator-based relocation problem in one-way electric carsharing systems
Computational aspects of lifted cover inequalities for knapsacks with few different weights
The generalized vertex cover problem and some variations
Online variable-sized bin packing with conflicts
Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines
The node-edge weighted 2-edge connected subgraph problem: Linear relaxation, facets and separation
Pivot and shift - a mixed integer programming heuristic
Approximate separable multichoice optimization over monotone systems
Computational complexity of some scheduling problems with multiprocessor tasks
The maximum k-colorable subgraph problem and orbitopes
Computing integral solutions of complementarity problems
Anchored rectangle and square packings
Strong polynomiality of resource constraint propagation
Robust combinatorial optimization with knapsack uncertainty
The inverse 1-median problem on a cycle
Vehicle routing with subtours
Orbitopal fixing
Approximating convex functions via non-convex oracles under the relative noise model
An improved greedy algorithm for stochastic online scheduling on unrelated machines
Ordered optimal solutions and parametric minimum cut problems
Chip firing and all-terminal network reliability bounds
On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph
Introducing article numbering to Discrete Optimization
Buyback problem with discrete concave valuation functions
Stable Marriage and Roommates problems with restricted edges: Complexity and approximability
Two classes of Quadratic Assignment Problems that are solvable as Linear Assignment Problems
Towards an efficient resolution of printing problems
Circuits in extended formulations
The computational complexity of the elimination problem in generalized sports competitions
Lift-and-project for general two-term disjunctions
An efficient algorithm for packing cuts and (2, 3)-metrics in a planar graph with three holes
Metric inequalities and the Network Loading Problem
L(2, 1)-labelling of graphs with few P 4 's
A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
On the maximum disjoint paths problem on edge-colored graphs
A two-phase tabu search based evolutionary algorithm for the maximum diversity problem
Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
The Wiener maximum quadratic assignment problem
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
The packing number of cubic graphs
Exact values of defective Ramsey numbers in graph classes
Pinpointing the complexity of the interval min-max regret knapsack problem
Optimization over structured subsets of positive semidefinite matrices via column generation
Computer-assisted proof of performance ratios for the Differencing Method
Orientations and detachments of graphs with prescribed degrees and connectivity
More on online bin packing with two item sizes
Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs
Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes
Decomposition into two trees with orientation constraints
Easy and difficult exact covering problems arising in VLSI power reduction by clock gating
Batched bin packing
On the analysis of optimization problems in arc-dependent networks
Approximating the multiple-depot multiple-terminal Hamiltonian path problem
Solving hard bi-objective knapsack problems using deep reinforcement learning
Four-point conditions for the TSP: The complete complexity classification
Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs
Algorithms for time-dependent bicriteria shortest path problems
Maximizing the Mostar index for bipartite graphs and split graphs
On bin packing with clustering and bin packing with delays
Facets of the independent path-matching polytope
A unified interpretation of several combinatorial dualities
The Hamiltonian connectivity of rectangular supergrid graphs
The two-dimensional bin packing problem with variable bin sizes and costs
Separation of cycle inequalities in periodic timetabling
Polyhedral results for a class of cardinality constrained submodular minimization problems
Description of 2-integer continuous knapsack polyhedra
A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
Generalized resolution search
An approximation algorithm for the Euclidean incremental median problem
Quadratic cone cutting surfaces for quadratic programs with on-off constraints
Partial immunization of trees
Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
New algorithms for convex cost tension problem with application to computer vision
On the edge capacitated Steiner tree problem
Integer rounding and modified integer rounding for the skiving stock problem
Single parameter analysis of power of preemption on two and three uniform machines
Equivariant perturbation in Gomory and Johnson's infinite group problem. VI. The curious case of two-sided discontinuous minimal valid functions
Joint mixability of some integer matrices
Tree-width and the Sherali-Adams operator
Using fractional primal-dual to schedule split intervals with demands
The k-aggregation closure for covering sets
Mixed integer programming
Scheduling a single machine to minimize a regular objective function under setup constraints
On non-superperfection of edge intersection graphs of paths
Integral cycle bases for cyclic timetabling
On reachability mixed arborescence packing
Reliability problems in multiple path-shaped facility location on networks
Tree decompositions of graphs: Saving memory in dynamic programming
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
The strength of Dantzig-Wolfe reformulations for the stable set and related problems
Constrained domatic bipartition on trees
A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization
The (K, k)-capacitated spanning tree problem
A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
New deterministic algorithms for solving parity games
Algorithms for the bounded set-up knapsack problem
Linear-time recognition of map graphs with outerplanar witness
A note on approximation of a ball by polytopes
Greedy algorithm for local heating problem
Fast training of Support Vector Machines with Gaussian kernel
Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
Packing mixed hyperarborescences
BDD-based optimization for the quadratic stable set problem
Rectangle packing with one-dimensional resource augmentation
Sparse regular induced subgraphs in 2P 3 -free graphs
A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
Symmetry-exploiting cuts for a class of mixed-0/1 second-order cone programs
Facets of the dynamic monopoly polytope: Linear ordering formulation