Country: United Kingdom

Found 17295 papers in total
Data envelopment analysis for weight derivation and aggregation in the analytic hierarchy process
Data envelopment analysis for weight derivation and aggregation in the analytic hierarchy process
2006,
Data envelopment analysis (DEA) is proposed in this paper to generate local weights of...
Evaluating alternative data envelopment analysis models used to control for non-discretionary inputs
Evaluating alternative data envelopment analysis models used to control for non-discretionary inputs
2006,
Evaluation of performance using DEA requires models consistent with the underlying...
Techniques for solving subset sum problems within a given tolerance
Techniques for solving subset sum problems within a given tolerance
2005,
The subset sum problem is a simple and fundamental NP-hard problem that is found in...
Maximum diversity/similarity models with extension to part grouping
Maximum diversity/similarity models with extension to part grouping
2005,
Maximum diversity/similarity models involve selecting a subset of desired size from a...
The capacitated centred clustering problem
The capacitated centred clustering problem
2006,
The capacitated centred clustering problem (CCCP) consists of defining a set of...
Cascades of queues
Cascades of queues
2006,
This paper presents results from a bulk service queueing system, where the main...
A paradox in optimal flow control of M/M/n queues
A paradox in optimal flow control of M/M/n queues
2006,
Optimal flow control problems of multiple-server (M/M/ n ) queueing systems are...
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
2006,
The state-of-the-art of local search heuristics for the traveling salesman problem...
Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
2006,
This paper presents a heuristic to solve the Multidimensional Multiple-choice Knapsack...
Event tree based sampling
Event tree based sampling
2006,
We develop a new sampling method, called an event tree-based sampling, which is...
A proximal trust-region algorithm for column generation stabilization
A proximal trust-region algorithm for column generation stabilization
2006,
This paper proposes a generalization of the proximal point algorithm using both...
Systematic construction of examples for cycling in the simplex method
Systematic construction of examples for cycling in the simplex method
2006,
We present systematic procedures to construct examples of linear programs that cycle...
A note on characterizing canonical cuts using geometry
A note on characterizing canonical cuts using geometry
2005,
In this technical note we introduce a set of cuts for 0–1 integer programming...
Template design under demand uncertainty by integer linear local search
Template design under demand uncertainty by integer linear local search
2006,
Production planning under uncertain demands leads to optimization problems that are...
Mixed binary interval goal programming
Mixed binary interval goal programming
2006,
This paper focuses on the mixed binary preferences decision problem associated with...
An approximate dynamic programming approach to convex quadratic knapsack problems
An approximate dynamic programming approach to convex quadratic knapsack problems
2006,
Quadratic knapsack problem (QKP) has a central role in integer and combinatorial...
Addressing capacity uncertainty in resource-constrained assignment problems
Addressing capacity uncertainty in resource-constrained assignment problems
2006,
Resource-constrained assignment problems typically assume capacities are known. We...
Markovian networks in labour markets
Markovian networks in labour markets
2006,
In labour theory, equilibrium is described in terms of mean variables, which is...
Efficient hybrid methods for global continuous optimization based on simulated annealing
Efficient hybrid methods for global continuous optimization based on simulated annealing
2006,
We introduce several hybrid methods for global continuous optimization. They combine...
Method of sentinels for packing items within arbitrary convex regions
Method of sentinels for packing items within arbitrary convex regions
2006,
A new method is introduced for packing items in convex regions of the Euclidian n...
Comparison of deterministic and stochastic approaches to global optimization
Comparison of deterministic and stochastic approaches to global optimization
2005,
In this paper, we compare two different approaches to nonconvex global optimization....
Splitting-type method for systems of variational inequalities
Splitting-type method for systems of variational inequalities
2006,
We consider a system of variational inequalities with multivalued mappings, which can...
Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps
Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps
2006,
The uncapacitated multi-facility Weber problem is concerned with locating m facilities...
Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
2006,
In this paper, we introduce a travel planning problem which is solved by computing...
Papers per page: