Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Country: Netherlands
Found
18376 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
The inequality-satisfiability problem
2008,
Hochbaum Dorit S.
We define a generalization of the satisfiability problem (SAT) where each...
Exploiting equalities in polynomial programming
2008,
Zuluaga Luis F.
We propose a novel approach for solving polynomial programs over compact domains with...
A note on the k-Canadian Traveller Problem
2008,
Westphal Stephan
We consider the online problem k -CTP, which is the problem to guide a vehicle from...
Partition inequalities for capacitated survivable network design based on directed p-cycles
2008,
Atamtrk Alper
We study the design of capacitated survivable networks using directed p-cycles. A...
An algorithm for achieving proportional delay differentiation
2008,
Abbad Mohammed
We consider the implementation of the proportional delay differentiation model with...
New formulations and valid inequalities for a bilevel pricing problem
2008,
Labb Martine
Consider the problem of maximizing the toll revenue collected on a multi-commodity...
The prize collecting Steiner tree problem: models and Lagrangean dual optimization approaches
2008,
Sherali Hanif D.
We propose a generalized version of the Prize Collecting Steiner Tree Problem (PCSTP),...
Finding upper-triangular representations for phase-type distributions with 3 distinct real poles
2008,
ltet Tams
In this paper we seek particular representations for absolutely continuous Phase-type...
A reflected diffusion process in a regime-switching environment
2008,
Shim Gyoocheol
This paper provides steady-state analysis of a reflected diffusion process governed by...
A note on calculating cost of two-dimensional warranty policy
2008,
Sinha Sagnik
We study the derivation of warranty cost under rectangular two-dimensional policy for...
The erlangization method for Markovian fluid flows
2008,
Ramaswami V.
For applications of stochastic fluid models, such as those related to wildfire spread...
Two classes of time-inhomogeneous Markov chains: Analysis of the periodic case
2008,
Alfa Attahiru Sule
We consider the M/G/1 and GI/M/1 types of Markov chains for which their one step...
Performance measures of a multi-layer Markovian fluid model
2008,
Bean Nigel G.
Our goal is to model the behaviour of the fluid in a buffer with threshold controls...
Geometric decay in level-expanding quasi-birth-and-death (QBD) models
2008,
Miyazawa Masakiyo
Level-expanding quasi-birth-and-death (QBD) processes have been shown to be an...
Second order fluid models with general boundary behaviour
2008,
Sericola B.
A crucial property of second order fluid models is the behaviour of the fluid level at...
Moment characterization of matrix exponential and Markovian arrival processes
2008,
Bodrog Levente
This paper provides a general framework for establishing the relation between various...
Markovian trees: properties and algorithms
2008,
Bean Nigel G.
In this paper we introduce a structure called the Markovian tree (MT). We define the...
Quasi-Birth–Death (QBD) Markov chains on binomial-like trees and its application to multilevel feedback queues
2008,
Houdt B. Van
A matrix analytic paradigm, termed Quasi-Birth–Death Markov chains on...
A monotone approximation algorithm for scheduling with precedence constraints
2008,
Krumke Sven O.
We provide a monotone O(m 2/3 ) -approximation algorithm for scheduling related...
Dispersed particle swarm optimization
2008,
Tan Ying
In particle swarm optimization (PSO) literatures, the published social coefficient...
Finding preferred subsets of Pareto optimal solutions
2008,
Jacobson Sheldon H.
Multi-objective optimization algorithms can generate large sets of Pareto optimal...
An improved algorithm for computing Steiner minimal trees in Euclidean d-space
2008,
Anstreicher Kurt M.
We describe improvements to Smith's branch-and-bound (B&B) algorithm for the...
A branch-and-cut approach to the crossing number problem
2008,
Jnger Michael
The crossing number of a graph is the minimum number of edge crossings in any drawing...
The Grothendieck constant of random and pseudo-random graphs
2008,
Alon Noga
The Grothendieck constant of a graph G=(V,E) is the least constant K such that for...
First Page
11
12
13
14
15
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers