yusuke1997/dblp-id-title huggingface dataset:
Multiterminal flows and cuts
Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: the bottleneck lower bound
A travelling salesman problem in the k-dimensional unit cube
Uncapacitated two-level lot-sizing
A noniterative multiproduct multiperiod production planning method
A branch-&-price approach to the unrooted maximum agreement forest problem
Average-case approximation ratio of the 2-opt algorithm for the TSP
SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
Risk-averse stochastic optimal control: An efficiently computable statistical upper bound
Resource location games
Direct graph k -partitioning with a Kernighan-Lin like heuristic
Stochastic geometric optimization with joint probabilistic constraints
The split closure of a strictly convex body
On the approximation ratio of the 3-Opt algorithm for the (1, 2)-TSP
On the sample path properties of mixed Poisson processes
A note on the MIR closure and basic relaxations of polyhedra
On upper bounds for assortment optimization under the mixture of multinomial logit models
Designing flexible systems using a new notion of submodularity
An on-line algorithm for multidimensional bin packing
Robust inverse optimization
An upper bound on the expected value of a non-increasing convex function with convex marginal return functions
Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
On the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals
Stochastic inequalities for M/G/1 retrial queues
On the asymptotic behaviour of the Aragón Artacho-Campoy algorithm
A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
A novel approach to Hölder continuity of a class of parametric variational-hemivariational inequalities
A note on Σ2p-completeness of a robust binary linear program with binary uncertainty set
Gradient boosting for convex cone predict and optimize problems
Price of Anarchy with multiple information sources under competition
On scheduling an unbounded batch machine
Optimal transport divergences induced by scoring functions
A short proof of optimality of the Bottom Up algorithm for discrete resource allocation problems
On the long-step path-following method for semidefinite programming
On pathwise behavior of queues
On the waiting times in queues with dependency between interarrival and service times
Recovering an optimal LP basis from an interior point solution
Stock optimization for service differentiated demands with fill rate and waiting time requirements
On-line scheduling to minimize max flow time: an optimal preemptive algorithm
To split or not to split: Selecting the right server with batch arrivals
Solving sequential knapsack problems
Some specially structured assemble-to-order systems
Monotonicity in multidimensional Markov decision processes for the batch dispatch problem
On-line scheduling with non-crossing constraints
Gap inequalities for non-convex mixed-integer quadratic programs
Bottleneck routing with elastic demands
Intertemporal service pricing with strategic customers
A good submatrix is hard to find
Excess invariance and shortfall risk measures
Relating single-scenario facets to the convex hull of the extensive form of a stochastic single-node flow polytope
Tailweight, quantiles and kurtosis: A study of competing distributions
Nonparametric identification and estimation of score auctions in multi-attribute procurement
Boundary effects in the traveling salesperson problem
A greedy heuristic for a minimum-weight forest problem
Three-player sequential contests with asymmetric valuations
A rounding procedure for semidefinite optimization
A short proof of the NP-completeness of minimum sum interval coloring
The steepest descent direction for the nonlinear bilevel programming problem
The complexity of computing a robust flow
An efficient approach for dual sourcing inventory systems with Tailored Base-Surge policies
A note on the finesse point
Improved bounds on the probability of a union and on the number of events that occur
A solvable case of the quadratic assignment problem
Robust single machine makespan scheduling with release date uncertainty
Quadratic resource allocation with generalized upper bounds
On the core of cooperative queueing games
A useful technique for piecewise deterministic Markov decision processes
How many clues to give? A bilevel formulation for the minimum Sudoku clue problem
Busy periods of discrete-time queues using the Lagrange implicit function theorem
Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines
Local cuts revisited
On the sum-product ratio problem and its applications
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem
The complexity of geometric scaling
A mean value formula for the M/G/1 queues controlled by workload
Bounds for global optimization of capacity expansion and flow assignment problems
On the power of lookahead in online lot-sizing
A fast exact pricing algorithm for the railway crew scheduling problem
Sensitivity-based nested partitions for solving finite-horizon Markov decision processes
A full-Newton step interior-point algorithm for linear optimization based on a finite barrier
Orthogonal schedules in single round robin tournaments
Delayed effects of cooperative advertising in goodwill dynamics
Stationary remaining service time conditional on queue length
Equilibrium balking strategies in the observable single-server queue with breakdowns and repairs
On the Kth best base of a matroid
A characterization of an n by 2n "Q0"-matrix
Erratum to "Two dimensional maximum weight matching using Manhattan topology" [Oper. Res. Lett. 50 (3) (2022) 281-286]
Global bounds for the distance to solutions of co-coercive variational inequalities
A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
Worst-case analysis of ( R , Q ) policies in a two-stage serial inventory system with deterministic demand and backlogging
Lower bounds for the Chvátal-Gomory rank in the 0/1 cube
An empirical Bayes procedure for the credit granting decision
An approximation algorithm for a facility location problem with stochastic demands and inventories
Relative ageing of series and parallel systems: Effects of dependence and heterogeneity among components
The balanced contributions property for symmetric players
A fast local search method for minimum energy broadcast in wireless ad hoc networks
Approximating the balanced minimum evolution problem
A lower bound for on-line scheduling on uniformly related machines
On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs
Variance reduction for sensitivity estimates obtained from regenerative simulation
Time-dependent queueing network approximations as simulation external control variates
Randomized two-valued bounded delay online buffer management
Optimal shift coloring of trees
Continuous line drawings via the traveling salesman problem
The coincidences among the semicore and the dominance core
On the inefficiency of state-independent importance sampling in the presence of heavy tails
Steepest ascent can be exponential in bounded treewidth problems
Strategic delegation in a differentiated duopoly with asymmetric costs
A constrained independent set problem for matroids
Direct solution of the normal equations in interior point methods for convex transportation problems
Exact simulation scheme for the Ornstein-Uhlenbeck driven stochastic volatility model with the Karhunen-Loève expansions
An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
Egalitarian allocation and players of certain type
The optimal policy for the one-against-many heterogeneous Lanchester model
A project game for PERT networks
On the complexity of locating linear facilities in the plane
A stochastic programming model to find optimal sample sizes to estimate unknown parameters in an LP
Strategic delegation under cost asymmetry revised
Choosing sample path length and number of sample paths when starting in steady state
On Padberg's conjecture about almost totally unimodular matrices
Online load balancing on uniform machines with limited migration
Algorithms better than LPT for semi-online scheduling with decreasing processing times
Faster algorithm and sharper analysis for constrained Markov decision process
On upper bounds for the multiple knapsack assignment problem
Uniqueness in quadratic and hyperbolic 0-1 programming problems
Does Bitcoin dominate the price discovery of the Cryptocurrencies market? A time-varying information share analysis
Optimality certificates for convex minimization and Helly numbers
Waiting time based routing policies to parallel queues with percentiles objectives
Compact vs. exponential-size LP relaxations
A new method of proving structural properties for certain class of stochastic dynamic control problems
Simplest cases of nth-degree stochastic dominance
Maximizing expected utility over a knapsack constraint
Convergent duality for the traveling salesman problem
Optimal choice for finite and infinite horizons
Single observation adaptive search for discrete and continuous stochastic optimization
On a duration problem with unbounded geometrical horizon
A short proof of convexity of step-out-step-in sequencing games
The value iteration method for countable state Markov decision processes
Cooperative equilibria of strategy-form games with both nontransferable and transferable utilities
When does the cµ rule apply to finite-population queueing systems?
Periodic review inventory control with fluctuating purchasing costs
Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
Approximation algorithms for the multiprocessor open shop scheduling problem
Robust absolute single machine makespan scheduling-location problem on trees
Threshold control by a single-server retrial queue with batch arrivals and group services
A polynomial algorithm for a continuous bilevel knapsack problem
An optimal maintenance policy for repairable systems with delayed repairs
Cover by disjoint cliques cuts for the knapsack problem with conflicting items
Optimal service rates for the state-dependent M/G/1 queues in steady state
Separation between second price auctions with personalized reserves and the revenue optimal auction
Asymptotics of the area under the graph of a Lévy-driven workload process
Parameterized approximations for the two-sided assortment optimization
On a connection between facility location and perfect graphs
Structural properties of optimal tool replacement policy in a machining center
Approximation algorithms for the a priori traveling repairman
A multi-agent inventory problem with general transportation costs
On the impossibility of decomposing binary matroids
Risk-sensitive dynamic pricing for a single perishable product
The advantage of relative priority regimes in multi-class multi-server queueing systems with strategic customers
Fast proximal algorithms for nonsmooth convex optimization
Maximizing revenue for publishers using header bidding and ad exchange auctions
Characterizing the value functions of polynomial games
Ornstein-Uhlenbeck processes time changed with additive subordinators and their applications in commodity derivative models
Portfolio selection with parameter uncertainty under α maxmin mean-variance criterion
Dual sourcing systems: An asymptotic result for the cost of optimal tailored base-surge (TBS) policy
On the complexity of recognizing integrality and total dual integrality of the {0, 1/2}-closure
On the assortment optimization with endogenized market size
A timing model for the revised simplex method
Characterizing rules in minimum cost spanning tree problems
An improved lower bound for a bi-criteria scheduling problem
Approximating bounded-degree spanning trees and connected factors with leaves
Certifying feasibility and objective value of linear programs
Optimal dividend-distribution strategy under ambiguity aversion
On the complexity of a maintenance problem for hierarchical systems
On degenerate multi-row Gomory cuts
Forest of stochastic meshes: A new method for valuing high-dimensional swing options
Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
On optimal flip-flop grouping for VLSI power minimization
Extended formulations for radial cones
Dominating set games
Reaching Paris Agreement goal through carbon dioxide removal development: A compact OR model
Optimal on-line algorithms for variable-sized bin covering
Optimality of admission control in a repairable queue
Computational algorithms for hierarchically structured project networks
Efficient sampling from phase-type distributions
Optimal sustainable use of drinking water sources and interactions between multiple providers
Generalization of Barahona's algorithm for cases of integer non-linear programming with box constraints
Convergence rate analysis of the multiplicative gradient method for PET-type problems
On Minty-variational inequalities and evolutionary stable states of generalized monotone games
State observation accuracy and finite-memory policy performance
On local search for the generalized graph coloring problem
Minimum deviation and balanced optimization: A unified approach
A wisdom rate allocation scheme in wireless networks
Approximating Nash equilibrium for production control with sticky price
Profit-based latency problems on the line
A note on non-degenerate integer programs with small sub-determinants
An inventory system with two suppliers and default risk
The Baum-Welch algorithm with limiting distribution constraints
Scalar representations and Hausdorff continuity of solution mappings to parametric set optimization problems via set less order relations
A perfect forward procedure for a single facility dynamic location/relocation problem
Power processes and their application to reliability
Delegated portfolio management under ambiguity aversion
Accelerating convergence in the Fermat-Weber location problem
A note on the quickest minimum cost transshipment problem
Corrigendum to "A new revenue sharing mechanism for coordinating multi-echelon supply chains" [Oper. Res. Lett. 38(4) (2010) 296-301]
Strategic behavior in queues with the effect of the number of customers behind
Optimality of (s, S, p) policy in a general inventory-pricing model with uniform demands
A new performance metric for the ski rental problem
M/G/1/MLPS compared to M/G/1/PS
On the complexity of cutting-plane proofs using split cuts
Complexity of a scheduling problem with controllable processing times
Color constrained combinatorial optimization problems
Robust binary optimization using a safe tractable approximation
On the stability of some integer programming algorithms
A three-class variance swapping technique for simulation experiments
The hardness of train rearrangements
Simplified semidefinite and completely positive relaxations
Who should be given priority in a queue?
Oligopoly newsvendor competition with reference effects
Approximation algorithms for the transportation problem with market choice and related models
A linear programming-based hyper local search for tuning hyperparameters
An approximation algorithm for vehicle routing with compatibility constraints
A linear-time algorithm for finding optimal vehicle refueling policies
On anti-cycling pivoting rules for the simplex method
A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
Two disjoint shortest paths problem with non-negative edge length
On the non-emptiness of the one-core and the bargaining set of committee games
Todd's low-complexity algorithm is a predictor-corrector path-following method
Analysis on the forward market equilibrium model
Initialization in semidefinite programming via a self-dual skew-symmetric embedding
An instant solution of the 2 × n bottleneck transportation problem
Optimality criterion for a class of nonlinear integer programs
A unified approach to multiple stopping and duality
Optimal switching policy for batch servers
Performance guarantees of jump neighborhoods on restricted related parallel machines
Complexity analysis and numerical implementation of a new interior-point algorithm for semidefinite optimization
Tim Roughgarden, Selfish Routing and the Price of Anarchy, MIT Press, Cambridge, MA (2005) ISBN 0-262-18243-2, pp 196
Matroidal approximations of independence systems
Covering skew-supermodular functions by hypergraphs of minimum total size
Measuring the impact of primal heuristics
2-Change for k-connected networks
On the convergence of conditional gradient method for unbounded multiobjective optimization problems
Transformations of generalized ATSP into ATSP
A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
Duality, area-considerations, and the Kalai-Smorodinsky solution
An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand
Distributionally robust stochastic optimal control
Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the Asymmetric Traveling Salesman Problem
A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
An upper bound on properly efficient solutions in multiobjective optimization
Revisiting prospect theory and the newsvendor problem
Iterated egalitarian compromise solution to bargaining problems and midpoint domination
A note on the performance of limited entry queuing systems
On a cost allocation problem arising from a capacitated concentrator covering problem
Bounding the variance in Monte Carlo experiments
Batch variance estimators for the median of simulation output
The bipartite travelling salesman problem: A pyramidally solvable case
Implied volatility slopes and jumps in bitcoin options market
The k -level facility location game
On the existence of compact ε-approximated formulations for knapsack in the original space
Inverse optimization in semi-infinite linear programs
A new and improved algorithm for the 3-cut problem
Geometric proofs for convex hull defining formulations
On improving the efficiency of an M/G/infinity generator of correlated traces
Optimal stochastic scheduling of two interconnected queues with varying service rates
Scheduling with a minimum number of machines
On BASTA for discrete-time queues
The expected relative error of the polyhedral approximation of the max-cut problem
Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
A note on the pathwise version of Little's formula
Designing a referral reward program in freemium: The role of network externalities
Convergence to equilibrium states for fluid models of many-server queues with abandonment
Mathematical programs with multiobjective generalized Nash equilibrium problems in the constraints
A note on the stability of monotone Markov chains
Dynamic matching with teams
On the EOQ model with inventory-level-dependent demand rate and random yield
Debt recapitalization and value in waiting to finance a project
Kőnig's edge-colouring theorem for all graphs
An analysis of the extended Christofides heuristic for the k-depot TSP
A real-time one-dimensional cutting stock algorithm for balanced cutting patterns
Speeding up COMPASS for high-dimensional discrete optimization via simulation
Asymmetric wheat auctions with resale and partially divisible bidding objects
Diffusion approximations for GI/M/s queues with service interruptions
Polynomiality of sparsest cuts with fixed number of sources
Non-nested estimators for the central moments of a conditional expectation and their convergence properties
Decision diagrams for solving traveling salesman problems with pickup and delivery in real time
Precise formulae for Bravo coefficients
An improved partial solution to the task assignment and multiway cut problems
A note on jackson networks with state-dependent rejection probabilities
A note on the serial dictatorship with project closures
A note on the asymptotic behaviour of bottleneck problems
A projected subgradient method for solving generalized mixed variational inequalities
A lexicographic pricer for the fractional bin packing problem
A dynamic price-only contract: Exact and asymptotic results
Must pollution abatement harm the supplier in a multi-echelon supply chain?
Sequential stochastic core of a cooperative stochastic programming game
Improved bound on the worst case complexity of Policy Iteration
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
Rationalizing vertical information flow in a bilateral monopoly
A strongly polynomial simplex method for the linear fractional assignment problem
Exploiting the structure of autoregressive processes in chance-constrained multistage stochastic linear programs
Rational and real positive semidefinite rank can be different
On the need for hybrid steps in hybrid proximal point methods
A note on policy algorithms for discounted Markov decision problems
Barvinok's naive algorithm in Distance Geometry
Algorithms for uniform optimal strategies in two-player zero-sum stochastic games with perfect information
On k-max-optimization
Advertisement allocation for generalized second-pricing schemes
The approximation ratio of the 2-Opt Heuristic for the metric Traveling Salesman Problem
A quadratic integer programming method for minimizing the mean squared deviation of completion times
On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
Optimal policies for the capacitated two stage multi-item inventory model with joint setup costs
On the extremality of maximal dual feasible functions
A note on sample-path stability conditions for input - output processes
Joint dynamic pricing and capacity control for hotels and rentals with advanced demand information
The inverse optimal value problem for linear fractional programming
Another well-solvable case of the QAP: Maximizing the job completion time variance
Cyclic regenerative method of simulation
The effect of long-memory arrivals on queue performance
Characterizing the nonemptiness and compactness of weakly efficient solution sets for non-convex multiobjective optimization problems
Vector-valued multivariate conditional value-at-risk
An improved standardized time series Durbin-Watson variance estimator for steady-state simulation
Allocating procurement to capacitated suppliers with concave quantity discounts
On the integrality ratio of the subtour LP for Euclidean TSP
A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures
Finding the projection onto the intersection of a closed half-space and a variable box
A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
On approximations of data-driven chance constrained programs over Wasserstein balls
Existence and uniqueness of optimal dynamic pricing and advertising controls without concavity
An exact algorithm for MAX-CUT in sparse graphs
Complexity results for the p-median problem with mutual communication
One-machine generalized precedence constrained scheduling problems
Properties of the multiple lot-sizing problem with rigid demand, general cost structures, and interrupted geometric yield
Scheduling shops to minimize the weighted number of late jobs
A new axiomatization of the Shapley-solidarity value for games with a coalition structure
Retail competition and cooperative advertising
Approximating separable nonlinear functions via mixed zero-one programs
Parallel algorithms for the assignment and minimum-cost flow problems
An approximation algorithm for square packing
A note on resolving infeasibility in linear programs by constraint relaxation