Service stations location problem
Sharp summability for Monge transport density via interpolation
Using some results proved in De Pascale and Pratelli [Calc. Var. Partial Differ. Equ. 14 (2002) 249-274] (and De Pascale et al. [Bull. London Math. Soc. 36 (2004) 383-395]) and a suitable interpolation technique, we show that the transport density relative to an source is also an function for any .
Sharp summability for Monge Transport density via Interpolation
Using some results proved in De Pascale and Pratelli [Calc. Var. Partial Differ. Equ.14 (2002) 249-274] (and De Pascale et al. [Bull. London Math. Soc.36 (2004) 383-395]) and a suitable interpolation technique, we show that the transport density relative to an Lp source is also an Lp function for any .
Shields-Harary numbers of graphs with respect to continuous concave cost functions.
Sign changes in linear combinations of derivatives and convolutions of Polya frequency functions.
Signal Group: Definitions and Algorithms
Signpost systems and spanning trees of graphs
By a ternary system we mean an ordered pair , where is a finite nonempty set and . By a signpost system we mean a ternary system satisfying the following conditions for all : if , then and ; if , then there exists such that . In this paper, a signpost system is used as a common description of a connected graph and a spanning tree of the graph. By a ct-pair we mean an ordered pair , where is a connected graph and is a spanning tree of . If is a ct-pair, then by the guide to...
Simple correspondence analysis of nominal-ordinal contingency tables.
Simulated Annealing and Joint Manufacturing Batch- Sizing
Simulated Annealing and Tabu Search for Discrete-Continuous Project Scheduling with Discounted Cash Flows
Discrete-continuous project scheduling problems with positive discounted cash flows and the maximization of the NPV are considered. We deal with a class of these problems with an arbitrary number of discrete resources and one continuous, renewable resource. Activities are nonpreemptable, and the processing rate of an activity is a continuous, increasing function of the amount of the continuous resource allotted to the activity at a time. Three common payment models – Lump Sum Payment, Payments at...
Simulation of Machine Interference in Randomly Changing Environments
Simulation Study of Production Process in the Sawmilling Industry
Simultaneous Determination of Economic Production Quantity and Economic Control Chart Design Under Truncated Weibull Shock Models
Simultaneous routing and flow rate optimization in energy-aware computer networks
The issue of energy-aware traffic engineering has become prominent in telecommunications industry in the last years. This paper presents a two-criteria network optimization problem, in which routing and bandwidth allocation are determined jointly, so as to minimize the amount of energy consumed by a telecommunication infrastructure and to satisfy given demands represented by a traffic matrix. A scalarization of the criteria is proposed and the choice of model parameters is discussed in detail. The...
Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
This paper is devoted to the following version of the single machine preemptive scheduling problem of minimizing the weighted number of late jobs. A processing time, a release date, a due date and a weight of each job are given. Certain jobs are specified to be completed in time, i.e., their due dates are assigned to be deadlines, while the other jobs are allowed to be completed after their due dates. The release/due date intervals are nested, i.e., no two of them overlap (either they have at most...
Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals
This paper is devoted to the following version of the single machine preemptive scheduling problem of minimizing the weighted number of late jobs. A processing time, a release date, a due date and a weight of each job are given. Certain jobs are specified to be completed in time, i.e., their due dates are assigned to be deadlines, while the other jobs are allowed to be completed after their due dates. The release/due date intervals are nested, i.e., no two of them overlap (either they have...
Single retrial queues with service option on arrival.
Single server queueing networks with varying sevice times and renewal input.
Single server tandem queues and queueing networks with non-correlated successive service times.
Single-commodity vehicle routing problem with pickup and delivery service.