yusuke1997/dblp-id-title huggingface dataset:
On the relations among the distributions at different epochs for discrete-time GI/Geom/1 queues
Complexity of the min-max and min-max regret assignment problems
Weak duality theorem and complementary slackness theorem for linear matrix programming problems
The quickest path problem with batch constraints
Continuous-time constrained stochastic games with average criteria
Payment models to coordinate healthcare providers: Extension to risk-averse providers
Speed scaling for stretch plus energy
Efficient algorithms for the reliabilities of replicated n-parallel-task graphs
A comment on multi-stage DEA methodology
On the complexity of robust geometric programming with polyhedral uncertainty
Increasing convex ordering of queue length in bulk queues
An implementation of steepest-descent augmentation for linear programs
Reformulation by discretization: Application to economic lot sizing
Low-rank extragradient methods for scalable semidefinite optimization
A Hotelling queue model with probabilistic service
A note on the k-minimum spanning tree problem on circles
Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs
On minimal cost-reliability ratio spanning trees and related problems
Complexity of linear minimization and projection on some sets
Approximation algorithm for the 2-stage stochastic matroid base problem
An algorithm for indefinite quadratic programming with convex constraints
Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
NPPMLE and NPPSIM: Software for estimating and simulating nonhomogeneous Poisson processes having cyclic behavior
Separating subdivision of bicycle wheel inequalities over cut polytopes
The approximation gap for the metric facility location problem is not yet closed
A two-phase algorithm for solving a class of hard satisfiability problems
Directed graphical structure, Nash equilibrium, and potential games
Minimizing total completion time on a batch processing machine with job families
Reverse contests
Pure strategy Nash equilibria and the probabilistic prospects of Stackelberg players
Maximum dispersion problem in dense graphs
On the complexity of the k -customer vehicle routing problem
Optimal equipment replacement without paradoxes: A continuous analysis
A new approach of cooperative interval games: The interval core and Shapley value revisited
Optimal policy for inventory systems with capacity commitment and fixed ordering costs
Grid scheduling with NBU service times
Condition-based maintenance optimization based on matrix algebra
On likelihood ratio ordering of parallel system with two exponential components
Approximating the stability region for binary mixed-integer programs
Spitzer's identity for discrete random walks
Canonical DC programming problem: Outer approximation methods revisited
Completion time variance minimization on a single machine is difficult
Linear-shaped partition problems
On globally solving the extended trust-region subproblems
Closed-form formulae for moment, tail probability, and blocking probability of waiting time in a buffer-sharing deterministic system
Mean-variance portfolio selection under a constant elasticity of variance model
An invariance property of sojourn times in cyclic networks
A simple algebraic approximation to the Erlang loss system
On active redundancy allocation for coherent systems - from the viewpoint of minimal cut decomposition
A constructive periodicity bound for the unbounded knapsack problem
An improved FPTAS for budgeted laminar matroid independent set
When an inefficient competitor makes higher profit than its efficient rival
Necessary conditions for global stability of multiclass queueing networks
An improved approximation algorithm for the partial Latin square extension problem
Sparse graphical designs via linear programming
Exact tail asymptotics for the Israeli queue with retrials and non-persistent customers
A polynomial algorithm for a one machine batching problem
Online learning for route planning with on-time arrival reliability
Computation of the random arrival rule for bankruptcy problems
Platform exploitation in the sharing economy
Determining the control limit policy in a replacement model with linear restoration
Can loss aversion explain sourcing diversification under supply risk?
Pay-to-bid auctions: To bid or not to bid
A dual approximation approach to weighted matroid intersection
Optimal retirement strategy with a negative wealth constraint
Shelf life of candidates in the generalized secretary problem
On stochastic decomposition in the GI/M/1 queue with single exponential vacation
On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms
Universally optimal staffing of Erlang-A queues facing uncertain arrival rates
k-Integrality, an extension of total unimodularity
Asymptotics of overflow probabilities in Jackson networks
A random arrival rule for airport problems with fuzzy costs
A tight bound on the speed-up through storage for quickest multi-commodity flows
On the minimization of a quasi-concave function subject to linear constraints
Analysis of Christofides' heuristic: Some paths are more difficult than cycles
The price of anarchy in an exponential multi-server
Preemptive scheduling of equal-length jobs to maximize weighted throughput
Lot-sizing with non-stationary cumulative capacities
Minimizing holding and ordering costs subject to a bound on backorders is as easy as solving a single backorder cost model
Modeling paradigms for discrete event simulation
Dynamic cost allocation for economic lot sizing games
Monte Carlo bounding techniques for determining solution quality in stochastic programs
Maximum density stable patterns in variants of Conway's game of Life
Approximation hardness of min-max tree covers
Strictly competitive games: Finite, countable and uncountable strategies
Average waiting time of a symmetric polling system under Bernoulli scheduling
A bilevel programming approach to the travelling salesman problem
Exact solution of a class of nonlinear knapsack problems
The uniquely solvable bipartite matching problem
Linear fractional approximations for master problems in column generation
Stochastic comparison of residual lifetime mixture models
Instability of FIFO in a simple queueing system with arbitrarily low loads
Identifying the optimal partition in convex quadratic programming
Gradual negotiations and proportional solutions
Comment on "A nonlinear Lagrangian dual for integer programming"
A new Pareto set generating method for multi-criteria optimization problems
Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs
Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms
A reverse search algorithm for the neighborhood problem
On the complexity of the primal self-concordant barrier method
Explicit formulas for the variance of conditioned sojourn times in M/D/1-PS
On the complexity of scheduling unrelated parallel machines with limited preemptions
Funding, repo and credit inclusive valuation as modified option pricing
Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
Approximating the Pareto set of multiobjective linear programs via robust optimization
A note on the optimality of the N - and D -policies for the M / G /1 queue
Optimal server assignment in a two-stage tandem queueing system
A note on maximal covering location games
Optimal dynamic pricing for sponsored search advertising
A long-step primal-dual path-following method for semidefinite programming
Binary, unrelaxable and hidden constraints in blackbox optimization
On the cardinality of the nondominated set of multi-objective combinatorial optimization problems
Zero-sum games for continuous-time Markov jump processes with risk-sensitive finite-horizon cost criterion
Local optimality conditions for multicommodity flow problems with separable piecewise convex costs
Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
On LICQ and the uniqueness of Lagrange multipliers
Uniform quasi-concavity in probabilistic constrained stochastic programming
Single-path routing of stochastic flows in networks
Erratum to "Cooperative equilibria of strategy-form games with both nontransferable and transferable utilities" [Oper. Res. Lett. 54 (2024) 107109]
Separation theorems for nonconvex sets and application in optimization
Two commodity flows
BMAP / G /1 queue with correlated arrivals of customers and disasters
On the convex programming approach to linear programming
Optimal procurement under backwardation and the benefits of the manifestation of demand aggregators
A note on queues with M / G /infinity input
Dynamic staffing in a telephone call center aiming to immediately answer all calls
Erratum to "A greedy algorithm for multicut and integral multiflow in rooted tress" [Oper. Res. Lett 31(1) (2003) 21-27]
Copula-based dependence between frequency and class in car insurance with excess zeros
Improving the Approximated Projected Perspective Reformulation by dual information
Robust learning in social networks via matrix scaling
An analytic valuation method for multivariate contingent claims with regime-switching volatilities
In-Out Algorithm for assortment planning under a ranking-based consumer choice model
Multiple sourcing: The determination of lead times
Stable sets, corner polyhedra and the Chvátal closure
A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access
A discrete variant of Farkas' Lemma
A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries
Influence maximization with partial feedback
Resource-robust valid inequalities for vehicle routing and related problems
On the noniterative multiproduct multiperiod production planning method
Disconnectedness Brings Robustness? On Network Design For Matching With Vertex Interdiction
Pseudo lower bounds for online parallel machine scheduling
The capacitated general windy routing problem with turn penalties
A simple algorithm for the multiway cut problem
A PTAS for a class of binary non-linear programs with low-rank functions
Klee-Minty's LP and upper bounds for Dantzig's simplex method
A discrete MAP/PH/1 queue with vacations and exhaustive time-limited service
Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
A note on natural risk statistics
A note on capacity models for network design
Solving probability transform functional equations for numerical inversion
Strategic delegation under cost asymmetry
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
A comparison of inventory policies for perishable goods
Online scheduling of parallel jobs on two machines is 2-competitive
Electricity market equilibrium under information asymmetry
Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks
Optimal arrangement of servers for a tollbooth tandem queue with two heterogeneous servers
Revisiting surrogate relaxation for the multidimensional knapsack problem
The unimodular intersection problem
Layers and matroids for the traveling salesman's paths
ASTA implies an M/G/1-like load decomposition for a server with vacations
Efficient data-driven optimization with noisy data
Sensitivity analysis for symmetric 2-peripatetic salesman problems
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem
Analytically simple and computationally efficient solution to GI/Geom/1 queues involving heavy-tailed distributions
Domino sequencing: Scheduling with state-based sequence-dependent setup times
A note on quadratic constraints with indicator variables: Convex hull description and perspective relaxation
Weighting in compromise programming: A theorem on shadow prices
On the feasibility of solutions to the split delivery vehicle routing problem represented as edge variables
Subgraph polytopes and independence polytopes of count matroids
The analysis of a multiserver queue fed by a discrete autoregressive process of order 1
Contractivity of Bellman operator in risk averse dynamic programming with infinite horizon
Relatively monotone variational inequalities over product sets
An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6
Some applications of nonnegative linear systems: Farkas strikes again
Faster approximation algorithms for weighted triconnectivity augmentation problems
On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
A note on optimal stopping of diffusions with a two-sided optimal rule
An optimal algorithm for 2 × n bottleneck transportation problems
Asymptotical good behavior on inequalities with completely approximate K-T concept
Intellectual property protection and platform digitalization empowering technology entrepreneurship in emerging markets
Forward chaining is simple( x )
Robust assortment optimization using worst-case CVaR under the multinomial logit model
A practical inventory control policy using operational statistics
Fatigue accumulation in dynamic contests
Integer programming, Barvinok's counting algorithm and Gomory relaxations
Maximizing non-monotone submodular set functions subject to different constraints: Combined algorithms
Data-driven preventive maintenance for a heterogeneous machine portfolio
Developing a closed-form cost expression for an (R, s, nQ) policy where the demand process is compound generalized Erlang
Accurate calculation of hazardous materials transport risks
Cycle times in single server cyclic Jackson networks
W[2]-hardness of precedence constrained K-processor scheduling
Endogenous reactive transshipment prices eliminate proactive transshipments and coordinate reactive transshipments
Concavity of system throughput and information transfer in a PAC system
Maximal workload, minimal workload, maximal workload difference: Optimizing all criteria at once
A power penalty method for second-order cone linear complementarity problems
Idealness and 2-resistant sets
Almost exact risk budgeting with return forecasts for portfolio allocation
The Shapley value for directed graph games
A tight lower bound for optimal bin packing
Three, four, five, six, or the complexity of scheduling with communication delays
Note on the complexity of the mixed-integer hull of a polyhedron
An optimal mechanism charging for priority in a queue
A note on optimal risk sharing on L p spaces
Strategic behavior in the partially observable Markovian queues with partial breakdowns
A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
Structured replacement policies for a Markov-modulated shock model
An algorithm for source location in directed graphs
Assembly line balancing as generalized bin packing
A knapsack intersection hierarchy
Optimization with binet matrices
Bidding to procure supply in newsvendor networks
Two-thirds is sharp for affine scaling
Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysis
Extension complexity of the correlation polytope
Exploiting symmetry in integer convex optimization using core points
A cost-sharing method for an economic lot-sizing game
Influence maximization independent of seed set size
Optimization with additional variables and constraints
The mean queue content of discrete-time queues with zero-regenerative arrivals
Dynamics of 2-worker bucket brigade assembly line with blocking and instantaneous walk-back
Large-sample normality of the batch-means variance estimator
Block-diagonal semidefinite programming hierarchies for 0/1 programming
Continuous-time Markowitz's model with constraints on wealth and portfolio
Pre-announced posted pricing scheme: Existence and uniqueness of equilibrium bidding strategy
The locomotive fleet fueling problem
Complexity of Source-Sink Monotone 2-parameter min cut
New structural properties of supply chains with price-only contracts
First passage time interdiction in Markov chains
A note on the probability of at least k successes in n correlated binary trials
On Gaussian Markov processes and Polya processes
On the combinatorial lower bound for the extension complexity of the Spanning Tree polytope
Cost analysis in global supply chains
Computing a maxian point of a simple rectilinear polygon
The price-setting newsvendor with nonlinear salvage revenue and shortage cost
Sparse tangent portfolio selection via semi-definite relaxation
Training and job search in the labor market
An efficient algorithm for the 3-satisfiability problem
A tandem queueing model with coupled processors
An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
Quick updates for p-opt TSP heuristics
A queueing system with returning customers and waiting line
Quality of move-optimal schedules for minimizing total weighted completion time
On the demand pooling anomaly in inventory theory
The competitive salesman problem on a network: a worst-case approach
A tandem network with MAP inputs
Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints
A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
A note on maximizing a submodular set function subject to a knapsack constraint
Tandem fluid queues fed by homogeneous on-off sources
Computation of the moments of queue length in the BMAP/SM/1 queue
Generalization of weighted-egalitarian Shapley values
Capacitated assortment and price optimization under the multinomial logit model
Semi-on-line problems on two identical machines with combined partial information
Channel-independent throughput-based fair queueing in wireless packet networks
On the complexity of the robust spanning tree problem with interval data
The Condorcet dimension of metric spaces
Sequential convergence of AdaGrad algorithm for smooth convex optimization
A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number
Sequential resource allocation with constraints: Two-customer case
Opaque selling in congested systems
On sojourn times in the finite capacity M/M/1 queue with processor sharing
Linear combinations of overlapping variance estimators for simulation
An average-case asymptotic analysis of the Container Relocation Problem
Probabilistic analysis of a bin covering algorithm
Uniqueness and characterization of capacity constrained Cournot-Nash equilibrium
Proportional-with-Leader-Bonus rules for group-buying with invitation behavior
An FPTAS for budgeted laminar matroid independent set
Weakly bipartite graphs and the Max-cut problem
Optimal feedback controls in deterministic dynamic two-machine flowshops
Introduction to ABACUS - a branch-and-cut system
Primal-dual hybrid gradient method for distributionally robust optimization problems
Approximate Pareto sets of minimal size for multi-objective optimization problems
Binary integer modeling of the traffic flow optimization problem, in the case of an autonomous transportation system
Pricing volatility derivatives under the modified constant elasticity of variance model
Complexity, algorithms and applications of the integer network flow with fractional supplies problem
Potential reduction algorithms for structured combinatorial optimization problems
A large-deviations analysis of Markov-modulated infinite-server queues
Pure threshold strategies for a two-node tandem network under partial information
Most vital links and nodes in weighted networks
Minimizing the sum of weighted completion times in a concurrent open shop
Consistency and the graph Banzhaf value for communication graph games
Minimizing the number of late jobs when the start time of the machine is variable
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem
Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost
Cooperative mutation based evolutionary programming for continuous function optimization
Algorithms for generalized round robin routing
A primal-dual simplex method for linear programs
Minimum-error classes for matching parts
Complexity bounds for approximately solving discounted MDPs by value iterations
A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs
Information sharing and information errors with noninferable demand
A second-order cone programming approach for linear programs with joint probabilistic constraints
Order-based backorders in multi-item inventory systems
A note on social learning in non-atomic routing games
Constant-factor approximations for Capacitated Arc Routing without triangle inequality
Cumulative operating time distributions for a class of non-Markovian series systems
A further result on an implicit function theorem for locally Lipschitz functions
Scheduling Markovian PERT networks to maximize the net present value: New results
Cost of capital for incentives on capacity expansion investments
A level-crossing approach to the solution of the shortest-queue problem
Local approximations for maximum partial subgraph problem
Optimal admission control for two station tandem queues with loss
Strong convergence of a splitting proximal projection method for the sum of two maximal monotone operators
On risk averse competitive equilibrium
A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
Errata and comments on "Approximation algorithms for the capacitated plant allocation problem": [Oper. Res. Lett 15 (1994) 115-126]
Using different response-time requirements to smooth time-varying demand for service
An optimal algorithm for the minimum-width cubic shell problem
A trust region algorithm for nonlinear bilevel programming
An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree
On optimal exhaustive policies for the M/G/1-queue
A combinatorial column generation algorithm for the maximum stable set problem
On the nearest neighbor rule for the traveling salesman problem
Incentive-compatible cost allocations for inventory games with private information
Total dual integrality and b-matchings
A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
Counterterror measures and economic growth: A differential game
Assortment optimization under the multinomial logit choice model with product-specific capacities
When the Gomory-Chvátal closure coincides with the integer hull
M/G/∞ with exponentially distributed setup times
Recursive calculation of moments in priority queues
Splitting versus setup trade-offs for scheduling to minimize weighted completion time
An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane
From estimation to optimization via shrinkage
Efficient solutions for a class of optimal stopping problems
A complete description of the traveling salesman polytope on 8 nodes
On the equivalence between some shortest path algorithms
An algorithm for finding a maximum clique in a graph
The benefit of preemption for single machine scheduling so as to minimize total weighted completion time
On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
An approximate algorithm for a high-multiplicity parallel machine scheduling problem
A note on polling models with renewal arrivals and nonzero switch-over times
An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions
Refined knowledge-gradient policy for learning probabilities
Exact tail asymptotics for the M/M/m retrial queue with nonpersistent customers
Sharp probability bounds for the binomial moment problem with symmetry
A remark about "A comment on consecutive-2-out-of- n systems"
A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
Echelon base-stock policies are financially sub-optimal