yusuke1997/dblp-id-title huggingface dataset:
A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems
A powerful route minimization heuristic for the vehicle routing problem with time windows
Sell or Hold: A simple two-stage stochastic combinatorial optimization problem
An LP-based 32-approximation algorithm for the s - t s-t path graph Traveling Salesman Problem
Optimal pricing for selling to a static multi-period newsvendor
Make waiting not to seem like waiting: Capacity management of waiting-area entertainment
A note on the integrality gap of an ILP formulation for the periodic maintenance problem
Existence and uniqueness of a fluid model for many-server queues with abandonment
Regulating an observable M/M/1 queue
Approximability of the robust representatives selection problem
A regular equilibrium solves the extended HJB system
Improved approximation for the capacitated inventory access point problem
Nash equilibrium strategies in repeated games with and without cost of implementation
Subsidizing purchases of public interest products: A duopoly analysis under a subsidy scheme
Copositive-plus Lemke algorithm solves polymatrix games
On functional limit theorems for the cumulative times in alternating renewal processes
Greedy vacancy search algorithm for packing equal circles in a square
Monotone optimal replacement policies for a Markovian deteriorating system in a controllable environment
An efficient algorithm for bin stretching
On the softplus penalty for large-scale convex optimization
On tariffs, policing and admission control for multiservice networks
Bounds on Malapportionment
A note on center problems with forbidden polyhedra
Scheduling with step-improving processing times
A bargaining game for implementing the equal gain splitting rule in sequencing situations
Simultaneous optimization of flow control and scheduling in a single server queue with two job classes
A generalization of renewal processes
Error bounds on a practical approximation for finite tandem queues
Hardness of approximation of the discrete time-cost tradeoff problem
Design of trees in the hose model: The balanced case
The restricted Chinese postman problems with penalties
A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
Corrigendum to "Heavy-Traffic Asymptotics for Stationary GI/G/1-Type Markov Chains" [Oper. Res. Lett. 40 (2012) 185-189]
Inventory placement on a network
Two simple applications of the unimodularity property
Diffusion approximation of a special bandwidth sharing model via infinitesimal generators with a lifting-projection method
Brownian analysis of a buffered-flow system in the face of sudden obsolescence
Valuing American options under the CEV model by Laplace-Carson transforms
Existence and computation of optimal tolls in multiclass network equilibrium problems
Approximate formulations for 0-1 knapsack sets
On optimal allocation of active redundancies to multi-state r-out-of-n systems
On the interplay between variability and negative dependence for bivariate distributions
On computing sparse generalized inverses
An exact algorithm for solving the bilevel facility interdiction and fortification problem
A reformulation for the stochastic lot sizing problem with service-level constraints
Distributionally robust optimization with correlated data from vector autoregressive processes
Optimal static priority rules for stochastic scheduling with impatience
Robust optimal strategies in Markov decision problems
A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set
A fully polynomial-time approximation scheme for approximating a sum of random variables
Capacity competition under random yield
How egalitarian are Nash equilibria in network cost-sharing games?
A geometric way to build strong mixed-integer programming formulations
Solving nonstationary infinite horizon stochastic production planning problems
The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands
On the single item fill rate for a finite horizon
An efficient randomized group testing procedure to determine the number of defectives
Quadratic double-ratio minimax optimization
Finding 2-edge connected spanning subgraphs
The complexity of minimizing the difference of two M ♮ -convex set functions
Valid integer polytope (VIP) penalties for branch-and-bound enumeration
Fairness in accessibility of public service facilities
Some theorems on conditional Pasta: A stochastic integral approach
A note on lateral transshipment under point-process driven demand
Sufficient conditions on nonemptiness and boundedness of the solution set of the P 0 function nonlinear complementarity problem
Asymptotic behavior of the stationary distribution in a finite QBD process with zero mean drift
Sustainable cooperation in multicriteria multistage games
A characterization of the uncapacitated network design polytope
Computing shortest heterochromatic monotone routes
A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
Approximations for the mean queue length of the GI X /G ( b , b ) / c queue
On the use of independent base-stock policies in assemble-to-order inventory systems with nonidentical lead times
Totally monotonic games and flow games
Uniform multicommodity flow through the complete graph with random edge-capacities
Convex minization over Z 2
On the brown method of exponential smoothing
Dynamic pricing with two revenue streams
Improved dynamic programs for some batching problems involving the maximum lateness criterion
Inventory control problem with freight cost and stochastic demand
Minimizing the maximum flow time in batch scheduling
Topological optimization of reliable networks under dependent failures
On index policies for stochastic minsum scheduling
A computational study on fill rate expressions for single-stage periodic review under normal demand and constant lead time
On the optimal design of the randomized unbiased Monte Carlo estimators
A strengthened formulation for the simple plant location problem with order
Tandem concavity with application to matching problems
An algorithm for solving general D.C. programming problems
Consolidating or non-consolidating queues: A game theoretic queueing model with holding costs
Job scheduling, cooperation, and control
A note on hierarchical hubbing for a generalization of the VPN problem
Structure importance of consecutive- k -out-of- n systems
A probabilistic result for the max-cut problem on random graphs
Energy-optimal scheduling with variable processing speed: The role of task size variability
A single server priority queue with server failures and queue flushing
Lock and no-lock mortgage plans: Is it only a matter of risk shifting?
On finding two-connected subgraphs in planar graphs
A distributed dual ascent algorithm for the Hop-constrained Steiner Tree Problem
On the average idle time and average queue length estimates in an M/M/1 queue
Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
Optimal strategies and values for monotone and classical mean-variance preferences coincide when asset prices are continuous
Network design with a discrete set of traffic matrices
On Pareto optimality conditions in the case of two-dimension non-convex utility space
On the complexity of Nurse Rostering problems
Asymptotic analysis for proximal-type methods in vector variational inequality problems
A note on clustering aggregation for binary clusterings
Concentration bounds for empirical conditional value-at-risk: The unbounded case
On the sufficiency of finite support duals in semi-infinite linear programming
An improved upper bound for the TSP in cubic 3-edge-connected graphs
Performance-based routing
Condition numbers for polyhedra with real number data
A two-stage approach for bi-objective integer linear programming
Linear programming with variable matrix entries
The reversibility of cyclic queues
Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates
Average fill rate and horizon length
On finiteness of the solution set of extended horizontal linear complementarity problem
A new extragradient-type method for mixed variational inequalities
New facets for the set packing polytope
On the probability of abandonment in queues with limited sojourn and waiting times
The 2-hop spanning tree problem
Heavy-traffic extreme-value limits for queues
An algorithm for approximating piecewise linear concave functions from sample gradients
Risk-sensitive finite-horizon piecewise deterministic Markov decision processes
Routing vehicles to minimize fuel consumption
A note on sign symmetry for a subclass of efficient, symmetric, and linear values
On the structure of capacitated assembly systems
A strongly polynomial algorithm for the minimum maximum flow degree problem
On constraint qualifications for second-order optimality conditions depending on a single Lagrange multiplier
Profit maximization in the M/M/1 queue
Some lower bounds on sparse outer approximations of polytopes
The non-Markovian nature of nested logit choice
Stochastic analysis of preventive maintenance in heterogeneous populations
Mean sample spacings, sample size and variability in an auction-theoretic framework
A note on exploiting the Hamiltonian cycle problem substructure of the Asymmetric Traveling Salesman Problem
On the transient analysis of the M X / M /infinity queue
A new proof of the Lagrange multiplier rule
How useful are preemptive schedules?
Fluid queues with synchronized output
The best-choice problem for partially ordered objects
A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization
A very difficult scheduling problem with communication delays
On the ring loading problem with demand splitting
Occupation times for the finite buffer fluid queue with phase-type ON-times
A note on a variant of the online open end bin packing problem
Verifiable conditions for average optimality of continuous-time Markov decision processes
Projected dynamical systems in a complementarity formalism
Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
How to bid in unified second-price auctions when requests are duplicated
On the convergence of an inexact Newton-type method
A polynomial case of the parsimony haplotyping problem
An improved Benders decomposition applied to a multi-layer network design problem
On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times
Weighing the "heaviest" Polya urn
Mechanism design for a multicommodity flow game in service network alliances
On complexity of finding strong-weak solutions in bilevel linear programming
A class of N-player Colonel Blotto games with multidimensional private information
A polyhedral characterization of the inverse-feasible region of a mixed-integer program
Exact solution of multicommodity network optimization problems with general step cost functions
A linear-time algorithm for solving continuous maximin knapsack problems
On some parallels between the loss probability in the GI/G/1 loss system and the delay probability in the GI/G/1 queue
Assembly at system level versus component level
Basic optimality results for Bayesian group replacement policies
Bin packing using semi-ordinal data
A polynomial-time algorithm to find an equitable home-away assignment
Generalized goal programming and variational inequalities
Corrigendum to "A scenario decomposition algorithm for 0-1 stochastic programs" [Oper. Res. Lett. 41(6) (2013) 565-569]
Two-connected Steiner networks: structural properties
Scheduling with batching: minimizing the weighted number of tardy jobs
An inexact algorithm for stochastic variational inequalities
A note on constant proportion trading strategies
The loss probability in an overloaded queue using the dual queue
On the existence of a short pivoting sequence for a linear program
A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters
A workload-dependent M / G /1 queue under a two-stage service policy
A revised approach for risk-averse multi-armed bandits under CVaR criterion
Incorporating views on marginal distributions in the calibration of risk models
Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers
From stars to comets: Improved local search for universal facility location
Optimal control of a simple assembly system
Analysis of the Held-Karp lower bound for the asymmetric TSP
The robust shortest path problem in series-parallel multidigraphs with interval data
Earliness-tardiness scheduling problems with a common delivery window
A note on Pareto minimizing total completion time and maximum cost
A polling system whose stability region depends on the whole distribution of service times
A comparison study on responsiveness of three mechanisms to affirmative action in school choice
Composition of stable set polyhedra
An O(n) bound for the diameter of transshipment polytopes
Routing jobs with deadlines to heterogeneous parallel servers
On the efficiency of price competition
Pricing in population games with semi-rational agents
MINTO, a mixed INTeger optimizer
Markov chain approximation methods in a class of level-crossing problems
A cooperative differential game model based on transmission rate in wireless networks
On the optimality of a maintenance queueing system
An improved subgradient method for constrained nondifferentiable optimization
Approximation algorithms for UET scheduling problems with exact delays
A multiplicative best-worst method for multi-criteria decision making
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
Uniqueness of equilibrium in a payment system with liquidation costs
Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
Analysis of optimal and nearly optimal sequencing policies for a closed queueing network
Some results on successive failure times of a system with minimal instantaneous repairs
A batch arrival M x /M/c queue with impatient customers
Computing k -centers of uncertain points on a real line
n-person non-convex bargaining: Efficient proportional solutions
On Gaver's parallel system sustained by a cold standby unit and attended by two repairmen
Some properties of the fleet assignment problem
Fast algorithms for the maximum convolution problem
Computing a common prior
Notes on polyhedra associated with hop-constrained paths
A polynomial-time approximation scheme for maximizing the minimum machine completion time
The network synthesis problem in a cycle
Dividend optimization for jump-diffusion model with solvency constraints
The influence of the node criticality relation on some measures of component importance
Asymptotic behavior of optimal quantities in symmetric transshipment coalitions
Symmetrization of generalized natural residual function for NCP
Inapproximability results for no-wait job shop scheduling
An FPTAS for scheduling with resource constraints
On the strength of time-indexed formulations for the resource-constrained project scheduling problem
An approach to single parameter process design
Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
Mean-variance portfolio selection with regime switching under shorting prohibition
A note on yardstick regulation of fishery monopolies
Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations
Communication-aware scheduling of precedence-constrained tasks on related machines
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
A Maclaurin-series expansion approach to multiple paired queues
Pitch, extension complexity, and covering problems
Improved front steepest descent for multi-objective optimization
Characterization of Pareto dominance
Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program
Carathéodory bounds for integer cones
Lifting Gomory cuts with bounded variables
Persuasive advertising under Bertrand competition: A differential game
Financial contagion and asset liquidation strategies
Bounds on revenue for the random consideration set choice model
The finagle point is close to the yolk
David L. Applegate, Robert E. Bixby, Vasek Chvátal , William J. Cook. The Traveling Salesman Problem: A Computational Study, Princeton University Press, Princeton, 2007, ISBN-13: 978-0-691-12993-8, 606 pp
Thinner is not always better: Cascade knapsack problems
Integer preemptive scheduling on parallel machines
Cliques and clustering: A combinatorial approach
Flexible supply policy with options and capacity constraints
A necessary condition for weak lumpability in finite Markov processes
Certification of an optimal TSP tour through 85, 900 cities
Censored lifetime learning: Optimal Bayesian age-replacement policies
A goodwill model with predatory advertising
Totally tight Chvátal-Gomory cuts
A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
Fast Engset computation
Derivatives and subderivatives of buffered probability of exceedance
On a class of order pick strategies in paternosters
Bounds and asymptotic results for the uniform parallel processor weighted flow time problem
SPAR: stochastic programming with adversarial recourse
Extended formulations for the cardinality constrained subtree of a tree problem
Dynamic behavior of k-out-of-n: G systems
Annuitization and asset allocation with borrowing constraint
A new result on second-order necessary conditions for nonlinear programming
On the set of weakly efficient minimizers for convex multiobjective programming
Optimal packet-to-slot assignment in mobile telecommunications
Privacy impact on generalized Nash equilibrium in peer-to-peer electricity market
A variable target value method for nondifferentiable optimization
Lot sizing in a no-wait flow shop
Reservation, a tool to reduce the balking effect and the probability of delay
A new lower bound approach for single-machine multicriteria scheduling
Discrete multi-module capacitated lot-sizing problems with multiple items
Accelerated label setting algorithms for the elementary resource constrained shortest path problem
A constraints-aware Reweighted Feasibility Pump approach
Solvable cases of the k-person Chinese postman problem
On the evaluation of bidding strategies in sequential auctions
A note on the finite convergence of alternating projections
An optimal proportion of perfect repair
Computational aspects of the maximum diversity problem
Confidence interval for M/M/2 queue with heterogeneous servers
A nonlinear minimax allocation problem with multiple knapsack constraints
Noncooperative facility location games
On Bellman's principle with inequality constraints
Additive envelopes of continuous functions
On relaxations of the max k -cut problem formulations
Revisiting a simple algorithm for the planar multiterminal cut problem
How difficult is the frequency selection problem?
Optimal quality provision when reputation is subject to random inspections
On the hardness of evaluating criticality of activities in a planar network with duration intervals
Robust risk-taking under a sustainable constraint
A note on Fiedler vectors interpreted as graph realizations
A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints
An algorithm for the hierarchical Chinese postman problem
Robust profit opportunities in risky financial portfolios
Asymptotic stability in replicator dynamics derived from TU games
Priority queues with batch Poisson arrivals
Optimal allocation policy for a multi-location inventory system with a quick response warehouse
Cosine: A new graph coloring algorithm
Prior reduced fill-in in solving equations in interior point algorithms
Probabilistic analysis of the minimum weighted flowtime scheduling problem
Semi-online scheduling with decreasing job sizes
Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem
On index priority sequencing rules for scheduling with time-dependent job processing times
An optimal algorithm for rectangle placement
On deviation measures in stochastic integer programming
A nontangential cutting plane algorithm
Zero-sum stochastic games with stopping and control
The resource allocation problem for demand forecasting and performance measurement
The use of decomposition techniques for the analysis of open restricted queuing networks
A queueing network model with catastrophes and product form solution
Solving large Steiner Triple Covering Problems
A note on the complexity of the asymmetric traveling salesman problem
Fluid models for many-server Markovian queues in a changing environment
Estimation for nonhomogeneous Poisson processes from aggregated data
On the asymptotic behavior of the expectation of the maximum of i.i.d. random variables
Two fluid approximations for multi-server queues with abandonments
Approximating Pareto curves using semidefinite relaxations
A constructive characterization of the split closure of a mixed integer linear program
A note on the discretization of Little's result
Generalized adaptive partition-based method for two-stage stochastic linear programs: Geometric oracle and analysis
Ordinally symmetric games
Descent line search scheme using Gers̆gorin circle theorem
Asymptotic optimality of the static frequency caching in the presence of correlated requests
Reliability of a system under two types of failures using a Markovian arrival process
On the convexity of the two-threshold policy for an M/G/1 queue with vacations
Extended formulations for matroid polytopes through randomized protocols
On the optimal assembly of series-parallel systems
Two due date assignment problems in scheduling a single machine
Remarks on projected solutions in generalized Nash games
On the k edge-disjoint 2-hop-constrained paths polytope
Does the financial market compensate investors for operational Losses?
Evaluating a warm standby system with components having proportional hazard rates
An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint
Modifying the BFGS method
Linear forms of nonlinear expressions: New insights on old ideas
Monge matrices make maximization manageable
Some results for quadratic problems with one or two quadratic constraints
BBPH: Using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs
A simple efficient approximation scheme for the restricted shortest path problem
On stochastic auctions in risk-averse electricity markets with uncertain supply
Certain expected values in the random assignment problem
A note on bias and mean squared error in steady-state quantile estimation
Optimal control of a production-inventory system with customer impatience
Distributed stochastic nonsmooth nonconvex optimization
A two-population game in observable double-ended queuing systems
Genetic algorithm with variable neighborhood search for the optimal allocation of goods in shop shelves
A new Lagrangian-based first-order method for nonconvex constrained optimization
On the credibility of the conditional risk model for routing hazardous materials
Parameter selection for nonnegative l 1 matrix/tensor sparse decomposition
Diffusion-level universality of many-server systems with concurrent service
Outbound shipment mode considerations for integrated inventory and delivery lot-sizing decisions
Theoretical investigations on maximal dual feasible functions
Locating minimal sets using polyhedral cones
Better than optimal mean-variance portfolio policy in multi-period asset-liability management problem
Constrained cost-coupled stochastic games with independent state processes