Journal: Pesquisa Operacional

Found 223 papers in total
How to estimate the amount of important characteristics missing in a consumers sample by using Bayesian estimators
How to estimate the amount of important characteristics missing in a consumers sample by using Bayesian estimators
2001,
Consumers surveys are conducted very often by many companies with the main objective...
Binomial trees models convergence for options evaluation
Binomial trees models convergence for options evaluation
2001,
Black & Scholes developed a model for pricing European call options on assets that...
Statistical properties of the return series of principal Brazilian stocks
Statistical properties of the return series of principal Brazilian stocks
2001,
This paper studies the returns of six Brazilian stocks, chosen among the most liquid...
A model for analysing the queuing problem in supermarket check-outs: a case study
A model for analysing the queuing problem in supermarket check-outs: a case study
2000,
In this study we applied queuing theory to analyze the problem of congestion in...
Minimizing flowtime subject to optimal makespan on two identical parallel machines
Minimizing flowtime subject to optimal makespan on two identical parallel machines
2000,
We consider the problem of scheduling jobs on two parallel identical machines where an...
Programming algorithm for individual machines with distinct penalties for earliness and tardiness
Programming algorithm for individual machines with distinct penalties for earliness and tardiness
2000,
In this work we consider the one machine problem, with distinct due-dates and...
An heuristic of changes for the scheduling problems of jobs in uniform processors
An heuristic of changes for the scheduling problems of jobs in uniform processors
2000,
This paper examines the nonpreemptive assignment of independent jobs to a system of...
The vehicle routing problem for school children transportation
The vehicle routing problem for school children transportation
2000,
This paper deals with the vehicle routing problem for school children transportation...
Pig production in Goias state: Using a spatial model
Pig production in Goias state: Using a spatial model
2000,
The main propose of this research work was to analyze the most efficient spatial...
A new lower bound for the bin-packing problem and its integration into the Martello–Toth procedure
A new lower bound for the bin-packing problem and its integration into the Martello–Toth procedure
1999,
In this paper a new lower bound for the Bin-Packing Problem (BPP) is introduced. This...
Facet-defining inequalities for the cutting stock problem
Facet-defining inequalities for the cutting stock problem
1999,
In this paper the polyhedron of the cutting stock problem is investigated with respect...
One dimensional cutting stock problem in just-in-time environment
One dimensional cutting stock problem in just-in-time environment
1999,
In this article we outline a procedure for solving a one-dimensional cutting stock...
The cutting stock problem with a given sequence of order lengths
The cutting stock problem with a given sequence of order lengths
1999,
This paper considers the one-dimensional cutting stock problem where the demand for a...
The strip cutting/packing problem: Incremental substrip algorithms-based heuristics
The strip cutting/packing problem: Incremental substrip algorithms-based heuristics
1999,
The strip cutting problem consists of cutting a large strip with a fixed-width and...
Non-guillotine placement of rectangles into a strip of given width
Non-guillotine placement of rectangles into a strip of given width
1999,
In this paper an exact method to solve the combinatorial problem of non-guillotine...
Geometrical objects regular placement onto a stock sheet or strip
Geometrical objects regular placement onto a stock sheet or strip
1999,
The paper deals with theoretical fundamentals of constructing rational periodic...
Packing squares into squares
Packing squares into squares
1999,
We consider the problem of packing a list of squares into unit capacity squares. The...
Applying constraint logic programming to the resolution of nesting problems
Applying constraint logic programming to the resolution of nesting problems
1999,
In nesting problems a two-dimensional piece of material must be divided into smaller...
Bounds for a problem of sequencing patterns
Bounds for a problem of sequencing patterns
1999,
In some wood cutting settings, the cutting sequence of the patterns produced to...
On the critical item for subset sum problems
On the critical item for subset sum problems
1999,
The Subset Sum Problem (SSP) is: ‘Given n positive integers w 1 , ..., w n ,...
Linear one-dimensional cutting–packing problems: Numerical experiments with sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
Linear one-dimensional cutting–packing problems: Numerical experiments with sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
2000,
Two algorithms for the one-dimensional cutting problem, namely, a modified...
The sequential value correction for the two-dimensional irregular cutting stock problem
The sequential value correction for the two-dimensional irregular cutting stock problem
2000,
This paper regards the problem of the two-dimensional irregular cutting stock problem,...
A cost minimization model in diagnostics with an application case in a blood bank
A cost minimization model in diagnostics with an application case in a blood bank
2000,
This work deals with the following problem: given a set of tests for a diagnosis...
‘d’ parameter estimation in ARFIMA models
‘d’ parameter estimation in ARFIMA models
2000,
ARFIMA models are characterized by both their long-range dependence and fractional...
Papers per page: