Now showing items 379-398 of 663

• #### Near optimality guarantees for data-driven newsvendor with temporally dependent demand: A Monte Carlo approach ﻿

(IEEE, 2013)
We consider a newsvendor problem with stationary and temporally dependent demand in the absence of complete information about the demand process. The objective is to compute a probabilistic guarantee such that the expected ...
• #### Near-optimal modified base stock policies for the capacitated inventory problem with stochastic demand and fixed cost ﻿

(World Scientific Publishing, 2014)
In this study, we investigate a single-item, periodic-review inventory problem where the production capacity is limited and unmet demand is backordered. We assume that customer demand in each period is a stationary, discrete ...
• #### Necessary and sufficient conditions for noiseless sparse recovery via convex quadratic splines ﻿

(Society for Industrial and Applied Mathematics Publications, 2019)
The problem of exact recovery of an individual sparse vector using the Basis Pursuit (BP) model is considered. A differentiable Huber loss function (a convex quadratic spline) is used to replace the $\ell_1$-norm in the ...
• #### Network hub location problems: The state of the art ﻿

(Elsevier, 2008)
Hubs are special facilities that serve as switching, transshipment and sorting points in many-to-many distribution systems. The hub location problem is concerned with locating hub facilities and allocating demand nodes to ...
• #### A neural network model for scheduling problems ﻿

(Elsevier, 1996)
Artificial neural networks (ANNs) have been successfully applied to solve a variety of problems. This paper proposes a new neural network approach to solve the single machine mean tardiness scheduling problem and the minimum ...
• #### A new bounding mechanism for the CNC machine scheduling problems with controllable processing times ﻿

(Elsevier, 2005)
In this study, we determine the upper and lower bounds for the processing time of each job under controllable machining conditions. The proposed bounding scheme is used to find a set of discrete efficient points on the ...
• #### New characterizations of ℓ1 solutions to overdetermined systems of linear equations ﻿

(Elsevier, 1994)
New characterizations of the ℓ1 solutions to overdetermined system of linear equations are given. The first is a polyhedral characterization of the solution set in terms of a special sign vector using a simple property of ...
• #### A new dominance rule for the total weighted tardiness problem ﻿

(Taylor & Francis, 1999)
We present a new dominance rule for the single machine total weighted tardiness problem with job dependent penalties. The proposed dominance rule provides a sufficient condition for local optimality. We show that if any ...
• #### A new dominance rule to minimize total weighted tardiness with unequal release dates ﻿

(Elsevier, 2001)
We present a new dominance rule by considering the time-dependent orderings between each pair of jobs for the single machine total weighted tardiness problem with release dates. The proposed dominance rule provides a ...
• #### New exact solution approaches for the split delivery vehicle routing problem ﻿

(Springer Verlag, 2018)
In this study, we propose exact solution methods for the split delivery vehicle routing problem (SDVRP). We first give a new vehicle-indexed flow formulation for the problem and then a relaxation obtained by aggregating ...
• #### A new finite continuation algorithm for linear programming ﻿

(Society for Industrial and Applied Mathematics, 1996)
We describe a new finite continuation algorithm for linear programming. The dual of the linear programming problem with unit lower and upper bounds is formulated as an f\ minimization problem augmented with the addition ...
• #### A new formulation approach for location routing-problems ﻿

(Springer, 2012-12)
A Location-Routing Problem (LRP) combines two difficult problems, facility location and vehicle routing, and as such it is inherently hard to solve. In this paper, we propose a different formulation approach than the common ...
• #### New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints ﻿

(Elsevier, 2010)
Given an undirected network with positive edge costs and a natural number p, the hop-constrained minimum spanning tree problem (HMST) is the problem of finding a spanning tree with minimum total cost such that each path ...
• #### New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints ﻿

(Elsevier, 2011)
Given an undirected network with positive edge costs and a natural number p, the Hop-Constrained Minimum Spanning Tree problem (HMST) is the problem of finding a spanning tree with minimum total cost such that each path ...
• #### New insights on the single machine total tardiness problem ﻿

(Palgrave Macmillan, 1997)
Virtually all algorithmic studies on the single machine total tardiness problem use Emmons' theorems that establish precedence relations between job pairs. In this paper, we investigate these theorems with a geometric ...
• #### A new lower bounding scheme for the total weighted tardiness problem ﻿

(1998)
We propose a new dominance rule that provides a sufficient condition for local optimality for the 1∥Σw1Ti problem. We prove that if any sequence violates the proposed dominance rule, then switching the violating jobs either ...
• #### A new model for the hazardous waste location-routing problem ﻿

(Elsevier, 2007)
Hazardous waste management involves the collection, transportation, treatment and disposal of hazardous wastes. In this paper a new multiobjective location-routing model is proposed. Our model also includes some constraints, ...
• #### New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs ﻿

(Elsevier, 2010)
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is important in practice, as the former criterion ...
• #### Newsboy inventory problem ﻿

(John Wiley & Sons, 2006)
A definition and classical formulation of the newsboy inventory model as a profit maximization problem is provided. The structure of the optimal stocking policy is given. Alternative formulations of mean-variance, down-side ...
• #### Newsboy inventory problem [reprint] ﻿

(John Wiley & Sons, 2010)
A definition and classical formulation of the newsboy inventory model as a profit maximization problem is provided. The structure of the optimal stocking policy is given. Alternative formulations of mean-variance, down-side ...