yusuke1997/dblp-id-title huggingface dataset:
Integer convex minimization by mixed integer linear optimization
Fitting discrete phase-type distribution from censored and truncated observations with pre-specified hazard sequence
On k-sum optimization
Semi-algebraic sets and equilibria of binary games
Lowest priority waiting time distribution in an accumulating priority Lévy queue
The Largest-Z-ratio-First algorithm is 0.8531-approximate for scheduling unreliable jobs on m parallel machines
An optimal job, consumption/leisure, and investment policy
The robust minimum spanning tree problem: Compact and convex uncertainty
A min-max theorem for the minimum fleet-size problem
On the information-based complexity of stochastic programming
A dynamic programming algorithm for the bilevel knapsack problem
Folk solution for simple minimum cost spanning tree problems
A note on single-processor scheduling with time-dependent execution times
The finagle point might not be within the ϵ-core
Capacitated assortment and price optimization for customers with disjoint consideration sets
An efficient mixture method
Analyzing auction and bargaining mechanisms in e-procurement with supply quality risk
The profitability of small horizontal mergers with nonlinear demand functions
Adaptive search with stochastic acceptance probabilities for global optimization
Bounds on the cleaning times of robot vacuums
Conditional value-at-risk in portfolio optimization: Coherent but fragile
Computing a minimum-width cubic and hypercubic shell
On the complexity of surrogate and group relaxation for integer linear programs
Scheduling on identical machines: How good is LPT in an on-line setting?
A sublinear-time randomized approximation algorithm for matrix games
A simple policy for multiple queues with size-independent service times
Multi-criteria TSP: Min and max combined
Valid inequalities for concave piecewise linear regression
Performance evaluation and ranking of Academy Award winners for Best Original Score applying Data Envelopment Analysis: 1990-2016
On the existence of ideal Nash equilibria in discontinuous games with infinite criteria
Should sophisticated expectations facilitate reaching equilibrium behavior?
Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
Is energy self sufficiency a realistic goal for Canada?
Hybrid or electric vehicles? A real options perspective
A two-phase queueing system with server vacations
Should R&D risk always be preferable?
On the inverse problem for a subclass of linear, symmetric and efficient values of cooperative TU games
Tight distortion bounds for distributed metric voting on a line
Exact solution of the SONET Ring Loading Problem
Linear dependence of stationary distributions in ergodic Markov decision processes
Using the analytic center in the feasibility pump
Resolution of the problem of degeneracy in a primal and dual simplex algorithm
A cost allocation rule for k-hop minimum cost spanning tree problems
Error bounds for affine variational inequalities with second-order cone constraints
Estimating the asymptotic variance with batch means
Robust linear optimization under general norms
NTU PERT games
A counterexample of the convergence of Rosen's algorithm with inexact line search
A reformulated Shapley-like value for cooperative games with interval payoffs
Dynamic pricing problems with elastic demand
Lifting of probabilistic cover inequalities
On stochastic comparisons of series systems with heterogeneous dependent and independent location-scale family distributed components
On first passage times of a hyper-exponential jump diffusion process
An O( n 4 ) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
A brief description of ALPO
Average stochastic games for continuous-time jump processes
Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time
Jacques Benders and his decomposition algorithm
P.G. Szabó, M.C. Markót, T. Csendes, E. Specht, L.G. Casado, I. García, New Approaches to Circle Packing in a Square, Springer, Berlin, 2007, ISBN: 978-0-387-45673-7, pp 238
Closed-form solution to a real option problem with regime switching
Supply chain coordination by manufacturer reward contract
The two-machine open shop problem: To fit or not to fit, that is the question
On embedding the volume algorithm in a variable target value method
Minimizing the error bound for the dynamic lot size model
Finding a bounded mixed-integer solution to a system of dual network inequalities
Cost allocation for set covering: The happy nucleolus
Analysis of the discrete-time bulk-service queue Geo/G Y /1/ N + B
A note on link formation and network stability in a Hotelling game
On a class of semimonotone Q 0 -matrices in the linear complementarity problem
On the structure of optimal solutions in a mathematical programming problem in a convex space
Mathematical modeling and analysis of insolvency contagion in an interbank network
On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous
A PTAS for capacitated sum-of-ratios optimization
A note on negative dynamic programming for risk-sensitive control
Time consistent cooperative solutions for multistage games with vector payoffs
A procedure to compute the nucleolus of the assignment game
Impulse control with random reaction periods: A central bank intervention problem
A note on the Boolean quadric polytope
The MA-ordering max-flow algorithm is not strongly polynomial for directed networks
Peter Cramton, Yoav Shoham and Richard Steinberg, Editors, Combinatorial Auctions, MIT Press, Cambridge, Massachusetts & London, England (2006) ISBN 0-262-03342-9, p. 669
On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem
Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects
A stochastic model for a vehicle in a dial-a-ride system
Categorized bottleneck-minisum path problems on networks
On history-dependent shock models
On Eulerian orientations of even-degree hypercubes
A new lower bound for the geometric traveling salesman problem in terms of discrepancy
Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
Generalized-Hukuhara penalty method for optimization problem with interval-valued functions and its application in interval-valued portfolio optimization problems
Optimal control of a queue under a quality-of-service constraint with bounded and unbounded rates
Extending the FCLT version of L=λW
Optimal stopping under g -expectation with constraints
Performance bound for myopic order-up-to inventory policies under stationary demand processes
Cutting planes from a mixed integer Farkas lemma
A new matrix bandwidth reduction algorithm
On continuity in risk-averse bilevel stochastic linear programming with random lower level objective function
Finding maximum matching for bipartite graphs in parallel
A nonnegative extension of the affine demand function and equilibrium analysis for multiproduct price competition
The fairest core in cooperative games with transferable utilities
On the solving strategy in composite heuristics
An O(K·n 4 ) algorithm for finding the k best cuts in a network
Strategic bilateral exchange of a bad
Monotone trends in inventory-price control under time-consistent coherent risk measure
Continuous-time zero-sum stochastic game with stopping and control
An upper bound on the independence number of a graph computable in polynomial-time
A greedy algorithm for solving ordinary transportation problem with capacity constraints
Analysis of the M/G/1 processor-sharing queue with bulk arrivals
An indicator for the switch from derivative-free to derivative-based optimization
The Shapley value, the Proper Shapley value, and sharing rules for cooperative ventures
A quadratically convergent descent method for the absolute value equation Ax+B|x|=b
Inventory management in a closed-loop supply chain with advance demand information
Generic rank-one corrections for value iteration in Markovian decision problems
Optimal payoff under the generalized dual theory of choice
BSDE approach to utility maximization with square-root factor processes
Envy-free two-player m m-cake and three-player two-cake divisions
The expected length of a random line segment in a rectangle
The Aumann-Shapley price mechanism for allocating congestion costs
Traveling salesman problem under categorization
Stochastic mathematical programs with equilibrium constraints
An improved monotone algorithm for scheduling related machines with precedence constraints
The m -machine flowshop problem with unit-time operations and intree precedence constraints
Hans Kellerer, Ulrich Pferschy and David Pisinger, Knapsack Problems , Springer, Berlin (2004) ISBN 3-540-40286-1 546pp., EUR 99, 95
Measuring the attractiveness of academic journals: A direct influence aggregation model
A PTAS for the disk cover problem of geometric objects
Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems
Optimal trunk reservation for an overloaded link
Robust univariate spline models for interpolating interval data
Anti-matroids
On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
A stochastic program based lower bound for assemble-to-order inventory systems
A proof of the optimality of the MIN paging algorithm using linear programming duality
A note about a transition of Ratliff and Rosenthal's order picking algorithm for rectangular warehouses
Optimal stochastic control of the intensity of point processes
Approximation algorithm for facility location with service installation costs
Crossing properties of reliability functions
Solving operational statistics via a Bayesian analysis
Quality improvement and process innovation in monopoly: A dynamic analysis
A semidefinite approach to the K i -cover problem
A new algorithm for reoptimizing shortest paths when the arc costs change
A new formulation for the conditional p-median and p-center problems
Bounding stochastic dependence, joint mixability of matrices, and multidimensional bottleneck assignment problems
On the optimal assignment of servers in a two stations tandem queue with no intermediate waiting room
Ergodic theorems for queuing systems with dependent inter-arrival times
Robust aircraft conflict resolution under trajectory prediction uncertainty
Extended formulations for stochastic lot-sizing problems
Sparsity of integer formulations for binary programs
A sufficient condition for asymptotically well behaved property of convex polynomials
Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program
Priority option pricing in an M/M/m
Monotonicity and supermodularity results for the Erlang loss system
Interior-point algorithm for linear optimization based on a new trigonometric kernel function
Decomposability and time consistency of risk averse multistage programs
On a class of mixed-integer sets with a single integer variable
A lower bound on seller revenue in single buyer monopoly auctions
Randomized on-line scheduling on three processors
A policy improvement method for constrained average Markov decision processes
Optimal control of price and production in an assemble-to-order system
Optimal investment strategy under time-inconsistent preferences and high-water mark contract
A general model for the undesirable single facility location problem
Improved algorithms for path partition and related problems
On the advantage of leadership in service pricing competition
Determining the right-hand vectors of an irredundant linear inequality system
A Gauss-Seidel iteration method for nonlinear variational inequality problems over rectangles
Time consistency of dynamic risk measures
Monotonicity in the stock competition game with consumer search
Addendum to "Generalized Nash equilibrium problem, variational inequality and quasiconvexity" [Oper. Res. Letters 36 (4) (2008) 461-464]
Combinatorial approximation algorithms: a comparative review
Polynomial algorithms for single machine scheduling problems with financial constraints
Exact SDP relaxations for classes of nonlinear semidefinite programming problems
Transfer pricing in a multidivisional firm: A cooperative game analysis
On the complexity of instationary gas flows
Optimal digital product maintenance with a continuous revenue stream
Lyapunov method for the stability of fluid networks
On the probability distribution of total quality under sublot inspection and process restoration
Price competition under linear demand and finite inventories: Contraction and approximate equilibria
An extended stochastic failure model for a system subject to random shocks
Dynamic optimal control of pollution abatement investment under emission permits
Non-linear equity portfolio variance reduction under a mean-variance framework - A delta-gamma approach
A simple recipe for concise mixed 0-1 linearizations
The parsimonious property of cut covering problems and its applications
On some algorithms for limiting average Markov decision processes
A polynomial algorithm for a multi-item capacitated production planning problem
A workload factorization for BMAP/G/1 vacation queues under variable service speed
A note on the support vector data description problem
A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs
A note on the never-early-exercise region of American power exchange options
Inverse barriers and CES-functions in linear programming
Potential functions for finding stable coalition structures
The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
On the convexity of loss probabilities when arrivals occur in batches and servers are heterogeneous
The optimal solution of ESG portfolio selection models that are based on the average ESG score
Exact algorithms for the Hamiltonian cycle problem in planar graphs
Andrzej Ruszczynski, Nonlinear Optimization, Princeton University Press, Princeton, NJ, 2006, ISBN 0-691-11915-5, 464 pp., $ 59.50
An improved algorithm for the minimax distribution-free inventory model with incident-oriented shortage costs
Continuous-time Markov decision processes under the risk-sensitive average cost criterion
Bias optimality for multichain continuous-time Markov decision processes
MB-GNG: Addressing drawbacks in multi-objective optimization estimation of distribution algorithms
Adaptive allocation rules for hypergraph games
The way of offering vertically differentiated airline services
Duopoly information sharing with differentiated products
Non-ergodicity criteria for denumerable continuous time Markov processes
Guidelines for the computational testing of machine learning approaches to vehicle routing problems
Disjoint cycles with different length in 4-arc-dominated digraphs
On semidefinite descriptions for convex hulls of quadratic programs
A simple finite cutting plane algorithm for integer programs
Subgradient decomposition and differentiability of the recourse function of a two stage stochastic linear program
Data-driven hedging of stock index options via deep learning
Robust response-guided dosing
Two-player bargaining problems with unilateral pre-donation
Revenue management on an on-demand service platform
CABRA: Clustering algorithm based on regular arrangement
Rounding to an integral program
Firms can benefit from inaccurate market beliefs
Exact results for the order picking time distribution under return routing
On mixed-integer sets with two integer variables
On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness
Distributionally robust Optimal Control and MDP modeling
A characterization of knapsacks with the max-flow- - min-cut property
An efficient representation of chordal graphs
Multi-period portfolio optimization: Translation of autocorrelation risk to excess variance
NP-hardness proof for the assembly problem with stationary setup and additive holding costs
On the relationship of capacitated production/inventory models to manufacturing flow control models
On the global stability of a peer-to-peer network model
On the replenishment policy considering less expensive but non-committed supply
Selling to customers with both Veblen and network effects
Decomposition approximations for time-dependent Markovian queueing networks
An analysis of voluntary recycled content claims under demand benefit and uncertain recycled input supply
Robust solutions of uncertain linear programs
On complexity of multistage stochastic programs under heavy tailed distributions
Anchored rescheduling problem with non-availability periods
On allocation of redundancies in two-component series systems
On the computational complexity of ordinal multi-objective unconstrained combinatorial optimization
Exact solving approach to moment problems with nonnegative Chebyshev ambiguity sets
The strength of multi-row aggregation cuts for sign-pattern integer programs
Proof of a conjecture of Schrage about the completion time variance problem
On complexity of multistage stochastic programs
On the minimal displacement vector of the Douglas-Rachford operator
Policies utilizing tactical inventory for service-differentiated customers
Corrigendum to "Approximation hardness of min-max tree covers" [Oper. Res. Lett. 38 (3) (2010) 169-173]
Competitive newsvendor problems with the same Nash and Stackelberg solutions
Improved approximation algorithm for the feedback set problem in a bipartite tournament
Pairwise independent correlation gap
A Shapley-based Groves mechanism: when the mechanism designer plays the wise man
A generic view of Dantzig-Wolfe decomposition in mixed integer programming
Q tensor tuples to polynomial complementarity problems
Bounds on optimal values in stochastic scheduling
Stationary analysis of a retrial queue with preemptive repeated attempts
Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps
An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
Some NP-complete problems in linear programming
Computing the worst-case due dates violations with budget uncertainty
Advance selling with preorder-dependent customer valuation
Minimizing makespan on a single batching machine with release times and non-identical job sizes
Robust confidence bands for stochastic processes using simulation
Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem
A 1-center problem on the plane with uniformly distributed demand points
First-break-heuristically-schedule: Constructing highly-constrained sports timetables
On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems
The robust spanning tree problem with interval data
Probability bounds for n random events under ( n - 1)-wise independence
M / G / k M/G/k with staggered setup
The effect of D-policy on the strategic customer behavior in M∕G∕1 queues
Open shop, satellite communication and a theorem by Egerváry (1931)
On the complexity of scheduling unit-time jobs with OR-precedence constraints
Bounds on the size of branch-and-bound proofs for integer knapsacks
Transient analysis of a Markovian queue with deterministic rejection
Some results on active redundancy at component level versus system level
Faces of diameter two on the Hamiltonian cycle polytype
On a cardinality-constrained transportation problem with market choice
Union negotiations: Complement-associated games
Analysis of Smith's rule in stochastic machine scheduling
Inferring most likely queue length from transactional data
The N threshold policy for the GI / M /1 queue
Factor based forecasts in universal portfolios via Dirichlet weights
Naor's model with heterogeneous customers and arrival rate uncertainty
Dependence structure of sojourn times via partition separated ordering
The combinatorics of pivoting for the maximum weight clique
A branch-and-price approach for the partition coloring problem
Generalised 2-circulant inequalities for the max-cut problem
Lexicographic balanced optimization problems
A greedy algorithm for multicut and integral multiflow in rooted trees
Inverse conic programming with applications
A sensitivity result for semidefinite programs
A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
A note on the characterization of the Barlow and Wu continuum structure functions
Column generation extensions of set covering greedy heuristics
Inventory and pricing policies under competition
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
Integration of progressive hedging and dual decomposition in stochastic integer programs
A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
On the complexity of pattern feasibility problems in time-relaxed sports timetabling
Randomized online interval scheduling
On-line scheduling on a batch machine to minimize makespan with limited restarts
Fixed-charge transportation problems on trees
Simulation factor screening using cross-spectral methods
Split cuts for robust mixed-integer optimization
Tree-compositions and orientations
Quantity strategies in economic networks
Payment mechanisms for electricity markets with uncertain supply
Permutatorial optimization via the permutahedron
Structural properties of the lost sales problem with fractional lead times
Dynamic lot sizing with random demand and non-stationary costs
Elementary closures for integer programs
Comments on: "A policy improvement method for constrained average Markov decision processes" [ORL 35 (2007) 434-438]
Branching on nonchimerical fractionalities
Open-loop policies in Bayesian dynamic pricing: Some counter-intuitive observations and insights
Identification of non-optimal arcs for the travelling salesman problem
On continuous network flows
Approximate analysis of discrete-time tandem queueing networks with bursty and correlated input traffic and customer loss
Enumerating maximal independent sets with applications to graph colouring
On the convergence of stochastic dual dynamic programming and related methods
Target radius methods for nonsmooth convex optimization
An improved lower bound for rank four scheduling
Greedy metric minimum online matchings with random arrivals
Playing against no-regret players
Comparing the costs of Any Fit algorithms for bin packing
Linear time-approximation algorithms for bin packing
Bounds and approximations for cycle times of a U-shaped production line
Minimax regret strategies for greenhouse gas abatement: methodology and application
Level-crossing approach to a time-limited service system with two types of vacations
On-line and off-line vertex enumeration by adjacency lists
Material compatibility constraints for make-to-order production planning
Bounded delay packet scheduling in a bounded buffer
On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
A note on equilibria for two-tier supply chains with a single manufacturer and multiple retailers
Solving the traveling salesman problem with interdiction and fortification
Does avoiding bad voting rules result in good ones?
Analyzing process flexibility: A distribution-free approach with partial expectations
Monotone effect of dependency between interarrival and service times in a simple queueing system
On popular response to violence during insurgencies
An alternative proof of the Kawaguchi-Kyan bound for the Largest-Ratio-First rule
Constraint qualification failure in action
Finding a good normal population
Separation of partition inequalities for the (1, 2)-survivable network design problem
Optimality of (s, S) policies for a stochastic inventory model with proportional and lump-sum shortage costs
Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
Optimal investment in development projects
Algorithms for the universal and a priori TSP
Sectionwise connected sets in vector optimization
Finding odd cycle transversals