Speeding up COMPASS for high-dimensional discrete optimization via simulation Fulltext Access 6 Pages 2010
Minimizing the sum of weighted completion times in a concurrent open shop Fulltext Access 6 Pages 2010
Stationary point conditions for the FB merit function associated with symmetric cones Fulltext Access 6 Pages 2010
Existence, uniqueness, and convergence of the regularized primal–dual central path Fulltext Access 6 Pages 2010
On zeroth-order general Randić index of quasi-tree graphs containing cycles Fulltext Access 6 Pages 2010
A simple algorithm for finding a maximum triangle-free 22-matching in subcubic graphs Fulltext Access 6 Pages 2010
Pinpointing the complexity of the interval min–max regret knapsack problem Fulltext Access 6 Pages 2010
Capacitated dynamic lot-sizing problem with delivery/production time windows Fulltext Access 6 Pages 2010
Optimal control of a production–inventory system with customer impatience Fulltext Access 6 Pages 2010
The equivalence of uniform and Shapley value-based cost allocations in a specific game Fulltext Access 6 Pages 2010
Weak aggregating algorithm for the distribution-free perishable inventory problem Fulltext Access 6 Pages 2010
The CoMirror algorithm for solving nonsmooth constrained convex problems Fulltext Access 6 Pages 2010
An approximate algorithm for a high-multiplicity parallel machine scheduling problem Fulltext Access 6 Pages 2010
A new revenue sharing mechanism for coordinating multi-echelon supply chains Fulltext Access 6 Pages 2010
Asymptotic representations for importance-sampling estimators of value-at-risk and conditional value-at-risk Fulltext Access 6 Pages 2010
Integrated production and distribution scheduling with committed delivery dates Fulltext Access 6 Pages 2010
An extended stochastic failure model for a system subject to random shocks Fulltext Access 6 Pages 2010
A new method of proving structural properties for certain class of stochastic dynamic control problems Fulltext Access 6 Pages 2010
Stochastic lot-sizing problem with deterministic demands and Wagner–Whitin costs Fulltext Access 6 Pages 2010
Facet-inducing web and antiweb inequalities for the graph coloring polytope Fulltext Access 6 Pages 2010
Inequalities of Nordhaus–Gaddum type for doubly connected domination number Fulltext Access 6 Pages 2010
Kernels by monochromatic paths in mm-colored unions of quasi-transitive digraphs Fulltext Access 6 Pages 2010
32–approximation algorithm for two variants of a 2-depot Hamiltonian path problem Fulltext Access 6 Pages 2010
Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date Fulltext Access 6 Pages 2010
A distributed dual ascent algorithm for the Hop-constrained Steiner Tree Problem Fulltext Access 6 Pages 2010
The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximability Fulltext Access 6 Pages 2010
Reprint of: Weak ϵ-nets have basis of size O(1/ϵlog(1/ϵ)) in any dimension Fulltext Access 7 Pages 2010
An involution for symmetry of hook length and part length of pointed partitions Fulltext Access 7 Pages 2010
Robust network optimization under polyhedral demand uncertainty is NPNP-hard Fulltext Access 7 Pages 2010
Improving the high order nonlinearity lower bound for Boolean functions with given algebraic immunity Fulltext Access 7 Pages 2010
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs Fulltext Access 7 Pages 2010
An implicit representation of chordal comparability graphs in linear time Fulltext Access 7 Pages 2010
Supereulerianity of kk-edge-connected graphs with a restriction on small bonds Fulltext Access 7 Pages 2010
A polyhedral study of triplet formulation for single row facility layout problem Fulltext Access 7 Pages 2010
An algorithm for stochastic programs with first-order dominance constraints induced by linear recourse Fulltext Access 7 Pages 2010