
| 4OR comes of age |
| Endogenous queue number determination in G/M/s systems |
| Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects |
| Min-max controllable risk problems |
| Modified forward–backward splitting method for variational inclusions |
| A note: flowshop scheduling with linear deterioration and job-rejectio |
| The power of linear programming: some surprising and unexpected LPs |
| A spectral three-term Hestenes–Stiefel conjugate gradient method |
| A comparison of penalty shootout designs in soccer |
| Coordination of a two-level supply chain with contracts |
| Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop |
| Exact distributional analysis of online algorithms with lookahead |
| On efficient testing of capacity constraints in pickup-and-delivery problems with trailers |
| The trouble with the second quantifier |
| A periodic review policy for a coordinated single vendor-multiple buyers supply chain with controllable lead time and distribution-free approach |
| Coordination of VMI supply chain with replenishment tactic under risk aversion and sales effort |
| Frank–Wolfe and friends: a journey into projection-free first-order optimization methods |
| Improving ADMMs for solving doubly nonnegative programs through dual factorization |
| Using the power of ideal solutions: simple proofs of some old and new results in location theory |
| A binary search algorithm for the general coupled task scheduling problem |
| A competitive optimization approach for data clustering and orthogonal non-negative matrix factorization |
| Comparing stage-scenario with nodal formulation for multistage stochastic problems |
| Inductive linearization for binary quadratic programs with linear constraints |
| Mixed integer programming formulations for the generalized traveling salesman problem with time windows |
| Pricing and strategy selection in a closed-loop supply chain under demand and return rate uncertainty |
| Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective |