yusuke1997/dblp-id-title huggingface dataset:
On lifted cover inequalities: A new lifting procedure with unusual properties
Computing inter-site distances for routing and scheduling problems
Aspects of a multivariate complexity analysis for Rectangle Tiling
A note on convex risk statistic
The maximum distribution of Kibble's bivariate gamma random vector
Reconstructing edge-disjoint paths
Ergodic inventory control with diffusion demand and general ordering costs
Improved complexities for stochastic conditional gradient methods under interpolation-like conditions
Complexity of two dual criteria scheduling problems
On the finite-buffer bulk-service queue with general independent arrivals: GI/M [ b ] /1/N
A strong conic quadratic reformulation for machine-job assignment with controllable processing times
A variable depth search branching
On equilibrium analysis of acyclic multiclass loss networks under admission control
An application of vertex packing to data analysis in the evaluation of pavement deterioration
Proximal point method for vector optimization on Hadamard manifolds
Approximation of the supply scheduling problem
On the asymptotic growth rate of some spanning trees embedded in R d
Admission control with batch arrivals
An elementary integrality proof of Rothblum's stable matching formulation
Unreliable newsboy problem with a forecast update
A 3/2-approximation algorithm for 3/2-partitioning
Observing general service queues before joining
Smoothed analysis of the k-swap neighborhood for makespan scheduling
List scheduling in a parallel machine environment with precedence constraints and setup times
Matroidal relaxations for 0-1 knapsack problems
A family of inequalities for the generalized assignment polytope
Price of anarchy for supply chains with partial positive externalities
Heavy-traffic limits for server idle times with customary server-assignment rules
An improved averaged two-replication procedure with Latin hypercube sampling
A minmax distribution free procedure for the (Q, R) inventory model
On the complexity of the one-terminal network design problem
Rate of convergence for proximal point algorithms on Hadamard manifolds
A new rule for the problem of sharing the revenue from museum passes
In: Stanley B. Gershwin, Yves Dallery, Chrissoleon T. Papadopoulos and J. MacGregor Smith, Editors, Analysis and Modeling of Manufacturing Systems, International Series in OperationsResearch and Management Science , Kluwer Academic Publishers, Boston, Dordrecht, London (2003) ISBN 1-4020-7303-8 429pp
An O(n log n) procedure for identifying facets of the knapsack polytope
Reversed absorbing Markov chain: A simple path approach
Duality in option pricing based on prices of other derivatives
Learning to guide local search optimisation for routing problems
A dynamic free-entry oligopoly with sluggish entry and exit adjustments
On the robust assignment problem under a fixed number of cost scenarios
Got organic milk? Joint inventory model with supply uncertainties and partial substitution
Error bounds for augmented truncation approximations of continuous-time Markov chains
A new approach to agglomeration problems
Steplengths in interior-point algorithms of quadratic programming
A better approximation algorithm for the budget prize collecting tree problem
Heavy-traffic asymptotics for stationary GI/G/1-type Markov chains
Scaling nonlinear programs
Critical edges for the assignment problem: Complexity and exact resolution
Some results on series and parallel systems of randomized components
Searching the k-change neighborhood for TSP is W[1]-hard
Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus
Order postponement in a supply chain in the presence of exponential demand with gamma prior
Arrival timing game for future limited items and full capacity announcement
On the lattice programming gap of the group problems
On the two-dimensional Knapsack Problem
Sorting weighted distances with applications to objective function evaluations in single facility location problems
Characterization of solution sets of convex programs
On the structure and complexity of the 2-connected Steiner network problem in the plane
Analytic pricing of volatility-equity options within Wishart-based stochastic volatility models
Fast algorithms for maximizing the minimum eigenvalue in fixed dimension
Polymatroids and mean-risk minimization in discrete optimization
The undirected two disjoint shortest paths problem
Statistics and game theory: Estimating coalitional values in R software
On total traffic domination in non-complete graphs
Constrained maximum variance stopping for a finite horizon increasing random walk
A modified proximal point algorithm with errors for approximating solution of the general variational inclusion
A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints
Nonexistence of a class of variate generation schemes
On the conjoint estimation of inconsistency and intransitivity of pairwise comparisons
Unary NP-hardness of minimizing total weighted tardiness with generalized due dates
A 12/7-approximation algorithm for the discrete Bamboo Garden Trimming problem
Time-dependent analysis of a single-server retrial queue with state-dependent rates
Characterizations of the optimal stable allocation mechanism
Determining the fill rate for a periodic review inventory policy with capacitated replenishments, lost sales and zero lead time
A deterministic inventory replenishment model with a linear trend in demand
An O(mn 2 ) algorithm for the Maximin problem in E 2
Piecewise equitable efficiency in multiobjective programming
Convergence and bound computation for chance constrained distributionally robust models using sample approximation
Convergence of first-order methods via the convex conjugate
Improving aggregation bounds for two-stage stochastic programs
The newsboy with known demand and uncertain replenishment: Applications to quality control and container fill
Cutting planes from two-term disjunctions
A simple, all primal branch and bound approach to pure and mixed integer binary programs
A simple approximation for mean waiting time in M/G/1 queue with vacations and limited service discipline
Parameterized (in)approximability of subset problems
A refined analysis of submodular Greedy
Market price-based convex risk measures: A distribution-free optimization approach
Multivariate estimation in regenerative simulation
A note on weighted completion time minimization in a flexible flow shop
A simple proof of the planar rectilinear Steiner ratio
Connectivity interdiction
How to improve the performance of ATM multiplexers
Faces with large diameter on the symmetric traveling salesman polytope
Pricing and distributed QoS control for elastic network traffic
Some consequences of estimating parameters for the M/M/1 queue
A feasible method for constrained derivative-free optimization
A full-Newton step interior-point algorithm based on modified Newton direction
On the existence of population-monotonic solutions on the domain of quasi-convex games
Locating two obnoxious facilities using the weighted maximin criterion
On the product portfolio planning problem with customer-engineering interaction
On the combined inverse-square effect of multiple points in multidimensional space
An optimal O(nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width
The "least flexible job first" rule in scheduling and in queueing
Study of M-stationarity and strong stationarity for a class of SMPCC problems via SAA Method
A stronger impossibility for fully online matching
Assessment of several algorithms for multi-period market equilibrium models with geometric distributed lag demand
A splitting scheme for control variates
Extended formulations for vertex cover
Weakly balanced contributions and solutions for cooperative games
The k-path coloring problem in graphs of bounded treewidth: An application in integrated circuit manufacturing
A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line
Stability of a priority queueing system with customer transfers
The Shapley value for the probability game
On the mean number of remaining components in three-state k-out-of-n system
A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
Erratum to "A unified approach to multiple stopping and duality" [Oper. Res. Lett. (2012)]
Approximations and auctions for scheduling batches on related machines
Almost tight bounds for online hypergraph matching
A conservative method for selecting the best simulated system
Resource augmentation in two-dimensional packing with orthogonal rotations
Busy period analysis for the GI/M/1 queue with exponential vacations
Shortest paths in almost acyclic graphs
Individual versus social optimization in statistical estimation
An approximation algorithm for the k-level stochastic facility location problem
The senior and junior secretaries problem
Markov decision processes with exponentially representable discounting
A mathematical programming approach to key-based election analysis
Four equivalent lot-sizing models
On maximizing a monotone k -submodular function under a knapsack constraint
A fair staff allocation rule for the capacity pooling of multiple call centers
Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times
A note of the knapsack problem with special ordered sets
Matrix-geometric analysis of the shortest queue problem with threshold jockeying
Arcwise connectedness of the solution sets for set optimization problems
Single courier single restaurant meal delivery (without routing)
Finite horizon partially observable semi-Markov decision processes under risk probability criteria
Weak aggregating algorithm for the distribution-free perishable inventory problem
Complexity of flow time minimization in a crossdock truck scheduling problem with asymmetric handover relations
Cournot competition with hyperbolic learning and myopic firms: A note
Relationship between least squares Monte Carlo and approximate linear programming
The quadratic 0-1 knapsack problem with series-parallel support
Uniformization for nonhomogeneous Markov chains
Component commonality under no-holdback allocation rules
On integer polytopes with few nonzero vertices
Complete analysis of finite and infinite buffer GI/MSP/1 queue - A computational approach
Squared deviations games: A subclass of market games and their Shapley value
A coalitional procedure leading to a family of bankruptcy rules
Polyhedral study of simple plant location problem with order
The regularized feasible directions method for nonconvex optimization
General sum games with joint chance constraints
Stable routing under the Spanning Tree Protocol
An alternative proof of the characterization of core stability for the assignment game
A polynomially solvable special case of the unbounded knapsack problem
Convex and concave envelopes: Revisited and new perspectives
Efficiency in Euclidean constrained location problems
A modified Markov model for the estimation of computer software performance
Eigenvalues of LRU via a linear algebraic approach
On the relationship between the integer and continuous solutions of convex programs
A new moment matching algorithm for sampling from partially specified symmetric distributions
Approximate algorithms for the travelling purchaser problem
Vertex disjoint cycles of different lengths in d-arc-dominated digraphs
Model of transfer tax on transboundary water pollution in China's river basin
Note on a paper of Broyden
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
Revenue-maximizing pricing and scheduling strategies in service systems with flexible customers
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date
A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows
A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
Robust portfolio selection with uncertain exit time using worst-case VaR strategy
Decomposition of the single machine total tardiness problem
Improved lower bounds for the capacitated lot sizing problem with setup times
Semidefinite representable reformulations for two variants of the trust-region subproblem
Resilience and reliability analysis of P2P network systems
Complexity of the Unconstrained Traveling Tournament Problem
A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows
Finite customer-pool queues
On the role of bottleneck Monge matrices in combinatorial optimization
An edge-reduction algorithm for the vertex cover problem
Manifolds of multi-leader Cournot equilibria
Multi-stage scenario generation by the combined moment matching and scenario reduction method
On robustness in nonconvex optimization with application to defense planning
A note on robust descent in differentiable optimization
Linear programming with online learning
A generalized Weiszfeld method for the multi-facility location problem
A dual algorithm for the minimum covering ball problem in R n
A sensitivity analysis of a (t i , S i ) inventory policy with increasing demand
When "Better" is better than "Best"
An auction with positive externality and possible application to overtime rules in football, soccer, and chess
Optimal control for parallel queues with a single batch server
Edge coloring nearly bipartite graphs
Structured p -facility location problems on the line solvable in polynomial time
Strongly strategic support of cooperative solutions for games over event trees
The communication complexity of private value single-item auctions
Mirror descent and nonlinear projected subgradient methods for convex optimization
Minmax regret solutions for minimax optimization problems with uncertainty
On the number of solutions generated by the dual simplex method
On the upper Lipschitz property of the KKT mapping for nonlinear semidefinite optimization
A single-level reformulation of mixed integer bilevel programming problems
A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis
Logit equilibrium as an approximation of Nash equilibrium
Generalised discounting in dynamic programming with unbounded returns
A shortage probability metric for battery depletion risk
On improving optimal oblivious routing
Optimal retail pricing, interest rate, and interest allocation ratio decisions in an online platform-assisted financing system
The discrete moment problem with fractional moments
A note on the reasonableness of PERT hypotheses
The pairwise flowtime network construction problem
Relating the multiple supply problem to quantity flexibility contracts
Lot streaming in open shops
Equilibrium strategies for queues with impatient customers
Practical enhancements to the Magnanti-Wong method
Parameterized complexity of configuration integer programs
Optimal information disclosure policies in strategic queueing games
On parallelizing dual decomposition in stochastic integer programming
Supplier diversification under binomial yield
A geometric convergence formula for the level-increment-truncation approximation of M/G/1-type Markov chains
Loss probability in an overloaded discrete-time GI/G/1/K system with very large K
Expediting exact linear programming solvers via integer preserving factorization
On the convergence of a modified algorithm for the spherical facility location problem
A PTAS for a resource scheduling problem with arbitrary number of parallel machines
General Hit-and-Run Monte Carlo sampling for evaluating multidimensional integrals
On degree sequence optimization
Strategic issues in college admissions with score-limits
A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces
An agreeable collusive equilibrium in differential games with asymmetric players
Envy-free matchings with one-sided preferences and matroid constraints
Dynamic lot-sizing model with demand time windows and speculative cost structure
Separating multi-oddity constrained shortest circuits over the polytope of stable multisets
Characterizing extreme points as basic feasible solutions in infinite linear programs
On the role of revenue-sharing contracts in supply chains
Robust spatiotemporally integrated fractionation in radiotherapy
An approximation algorithm for the k-Level Concentrator Location Problem
Spaced batch means
Colorings of k-balanced matrices and integer decomposition property of related polyhedra
Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games
Scoring indices, top-truncated preferences, and splitting invariance
Separating tight metric inequalities by bilevel programming
A new efficient short-step projective interior point method for linear programming
Assessing systematic sampling in estimating the Banzhaf-Owen value
Time aggregated Markov decision processes via standard dynamic programming
General 0-1 fractional programming with conditional fractional terms for design of food frequency questionnaires
Contracting with asymmetric cost information in a dual-channel supply chain
Salesforce contract design and inventory planning with asymmetric risk-averse sales agents
Perishable inventory systems with batch demand and arrivals
Minimizing the total completion time in a unit-time open shop with release times
A note on supplier diversification under random yield
On the core of traveling salesman games
The first-order approach to the principal-agent problems under inequality aversion
Fixed order scheduling with deadlines
Shortest paths in piecewise continuous time-dependent networks
A heavy-traffic-limit formula for the moments of the stationary distribution in GI/G/1-type Markov chains
A polynomial-time algorithm for the change-making problem
Persistency in maximum cardinality bipartite matchings
On bivariate dependence and the convex order
A comparison of frequency domain methodology and conventional factor screening methods
New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
Polynomial-time separation of Enhanced Reverse Multistar inequalities
Valid inequalities for mixed-integer programmes with fixed charges on sets of variables
A Poisson-Charlier approximation for nonstationary queues
The M x /G/1 queue with single and multiple vacations under the LIFO service regime
On pathological disjunctions and redundant disjunctive conic cuts
Batch scheduling to minimize maximum lateness
Multiple replenishment orders in a continuous-review inventory system with lost sales
A multi-stage methodology for the solution of orientated DEA models
Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay
Solving two-stage robust optimization problems using a column-and-constraint generation method
Optimal discounts for the online assignment problem
On interval-subgradient and no-good cuts
On the many-server fluid limit for a service system with routing based on delayed information
Tractable reformulations of two-stage distributionally robust linear programs over the type-∞ Wasserstein ball
An extension of the fundamental theorem of linear programming
Approximation methods for discrete lot streaming in flow shops
Heavy-traffic limits for Discriminatory Processor Sharing models with joint batch arrivals
Super-stable common independent sets of generalized matroids
On the computational complexity of reliability redundancy allocation in a series system
On the economic lot scheduling problem with backlogging: The common cycle approach
Integrality gap of the vertex cover linear programming relaxation
A decomposition heuristic for mixed-integer supply chain problems
An impossibility result for housing markets with fractional endowments
Optimal bundle pricing with monotonicity constraint
Efficient data allocation for frequency domain experiments
Poisson and non-Poisson properties in appointment-generated arrival processes: The case of an endocrinology clinic
Gear composition and the stable set polytope
Constructing fair round robin tournaments with a minimum number of breaks
Finding the K shortest hyperpaths using reoptimization
Approximating minimum-cost graph problems with spanning tree edges
Notes on average Markov decision processes with a minimum-variance criterion
Socially responsible merchant operations: Comparison of shutdown-averse CVaR and anticipated regret policies
Reduced game and constrained egalitarianism
Optimal admission and preemption control in finite-source loss systems
On joint probabilistic constraints with Gaussian coefficient matrix
Analyzing social media data having discontinuous underlying dynamics
A note on the problem of r disjoint (s, t)-cuts and some related issues
Partially observed Markov decision processes with binomial observations
An improved upper bound on the integrality ratio for the s-t-path TSP
A branch-and-cut algorithm for the maximum cardinality stable set problem
New necessary and sufficient condition for the irreducibility of joint inventory positions in an assemble-to-order system
Some tractable instances of interval data minmax regret problems
Busy period analysis of the state dependent M/M/1/K queue
On the concavity of multivariate probability distribution functions
Negotiated price discounting of perishable inventories
A class of joint production and transportation planning problems under different delivery policies
Existence results for quasi-equilibrium problems under a weaker equilibrium condition
k-edge connected polyhedra on series-parallel graphs
What is the optimal cutoff surface for ore bodies with more than one mineral?
Socially fair network design via iterative rounding
The convergence of value iteration in average cost Markov decision chains
Maximal descriptor set characterizations of efficient faces in multiple objective linear programming
The integer L-shaped method for stochastic integer programs with complete recourse
Stochastic single machine scheduling with an exponentially distributed due date
On the minimax approximation in the class of the univariate piecewise constant functions
Risk aversion and implicit shortage cost explain the Anchoring and Insufficient Adjustment bias in human newsvendors
The M/M/1+M queue with a utility-maximizing server
Strategic bidding in a discrete accumulating priority queue
Optimal picking of large orders in carousel systems
Transshipments between (counter-) altruistic retailers
Does inventory pooling improve customer service levels?
Economic lot sizing: The capacity reservation model
A family of facets for the uncapacitated p -median polytope
An approximation scheme for impulse control with random reaction periods
(Un)stable matchings with blocking costs
Beyond efficiency: Exploring the cost effects of prioritizing driver satisfaction in vehicle routing
The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges
The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables
Sparse certificates and removable cycles in l -mixed p -connected graphs
Another greedy heuristic for the constrained forest problem
Preservation of transform orders under a semiparametric model and its mixture
The SC
A primal-simplex based Tardos' algorithm
Estimating stock levels in periodic review inventory systems
Weakly and properly nonessential objectives in multiobjective optimization problems
The dynamics of asset lifetime under technological change
Note on the fill rate of single-stage general periodic review inventory systems
A note on the continuous mixing set
A note on a limit interchange for many-server queues
The p-maxian problem on a tree
A minmax regret median problem on a tree under uncertain locations of the demand points
Algorithmic results for ordered median problems
The efficient proportional Myerson values
An exact algorithm for IP column generation
A simple heuristic for echelon (r, nQ, T) policies in serial supply chains
A note on the assignment problem with uniform preferences