Keyword: programming: mathematical

Found 852 papers in total
Stackelberg hub location problem
Stackelberg hub location problem
2001,
In this paper, we consider a new competitive hub location model called Stackelberg hub...
A meta-representation for integrating operational research and artificial intelligence in an intelligent decision support paradigm
A meta-representation for integrating operational research and artificial intelligence in an intelligent decision support paradigm
2001,
Operational research (OR) and artificial intelligence (AI) models are primary...
Mathematical model for determining machining parameters in multipass turning operations with constraints
Mathematical model for determining machining parameters in multipass turning operations with constraints
2001,
This paper presents a new mathematical programming model for optimizing process...
Mixed integer programming for scheduling surface mount technology lines
Mixed integer programming for scheduling surface mount technology lines
2001,
This paper presents new mixed integer programming formulations for blocking scheduling...
Analysis of upper bounds for the pallet loading problem
Analysis of upper bounds for the pallet loading problem
2001,
This paper is concerned with upper bounds for the well-known Pallet Loading Problem,...
The national energy modeling system: A large-scale energy-economic equilibrium model
The national energy modeling system: A large-scale energy-economic equilibrium model
2001,
The National Energy Modeling System (NEMS) is a large-scale mathematical model that...
A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
2001,
This paper considers solving a special case of the nonadditive traffic equilibrium...
Constraint proposed method for computing Pareto solutions in multi-party negotiations
Constraint proposed method for computing Pareto solutions in multi-party negotiations
2001,
The constraint proposal method for computing Pareto-optimal solutions is extended to...
Resource allocation and time preference in the district health care planning of developing countries
Resource allocation and time preference in the district health care planning of developing countries
2001,
The inter-temporal allocation of scarce resources to different providers of services...
Siting noxious facilities under uncertainty
Siting noxious facilities under uncertainty
2001,
In this paper we address the stochastic capacitated hazardous materials facility...
Short-term modelling in refinery planning – and why ‘non-linear’ is not necessarily ‘more accurate’
Short-term modelling in refinery planning – and why ‘non-linear’ is not necessarily ‘more accurate’
1999,
The oil industry was one of the earliest users of linear programming. For many years,...
0–1 optimization of quadratic form by expanding the parameter space
0–1 optimization of quadratic form by expanding the parameter space
2001,
This paper is concerned with 0–1 quadratic optimization problems. We formulate...
Julian's problem – work assignment at a disabled care centre
Julian's problem – work assignment at a disabled care centre
1999,
A centre that employs handicapped people wants to generate its weekly schedule...
A mathematical programming model for production planning using constant work-in-progress (CONWIP)
A mathematical programming model for production planning using constant work-in-progress (CONWIP)
2001,
Push-based MRP and pull-based Kanban systems are effective planning tools for a wide...
Two mixed integer linear programming models for the N × M sequence dependent set-up times flowshop sequencing problem
Two mixed integer linear programming models for the N × M sequence dependent set-up times flowshop sequencing problem
2001,
This paper presents the derivation and evaluation of two new MILP models for the SDST...
The multi-hour service system design problem
The multi-hour service system design problem
2001,
This paper studies the multi-hour service system design problem that involves locating...
Analysis of the potential for spatial redistribution of freight using mathematical programming
Analysis of the potential for spatial redistribution of freight using mathematical programming
2001,
In recent years, research has identified the spatial spreading of freight distribution...
A global supply chain model with transfer pricing and transportation cost allocation
A global supply chain model with transfer pricing and transportation cost allocation
2001,
We present a model for the optimization of a global supply that maximizes the after...
Static competitive facility location: An overview of optimisation approaches
Static competitive facility location: An overview of optimisation approaches
2001,
We give an overview of the research, models and literature about optimisation...
A reduction result for location problems with polyhedral barriers
A reduction result for location problems with polyhedral barriers
2001,
In this paper we consider the problem of locating one new facility in the plane with...
Modeling and algorithmic development of a staff scheduling problem
Modeling and algorithmic development of a staff scheduling problem
2001,
The problem of scheduling workers at a hub of a trucking system for the stripping and...
Assortment planning in fashion retailing: methodology, application and analysis
Assortment planning in fashion retailing: methodology, application and analysis
2001,
Assortment planning is the process conducted by the retailer to determine the number...
Bicriteria location of a semi-obnoxious facility
Bicriteria location of a semi-obnoxious facility
1999,
The problem of locating a new semi-obnoxious facility in an existing layout is...
An interior point multiobjective programming approach for production planning with uncertain information
An interior point multiobjective programming approach for production planning with uncertain information
1999,
This paper describes a conceptually simple but practical business planning method to...
Papers per page: