Now showing items 31-40 of 8748
A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network
(World Scientific and Engineering Acad and Soc, 2009-01-01)
Assigning cells to switches in a cellular mobile network is known as an NP-hard optimization problem. This means that the alternative for the solution of this type of problem is the use of heuristic methods, because they ...
Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types
We study the design of mechanisms for a sequencing problem where the types of job-agents consist of processing times and waiting costs that are private to the jobs. In the Bayes-Nash setting, we seek to find a sequencing ...
Algorithms for network piecewise-linear programs: A comparative study
Piecewise-Linear Programming (PLP) is an important area of Mathematical Programming and concerns the minimisation of a convex separable piecewise-linear objective function, subject to linear constraints. In this paper a ...
Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations
The irregular strip packing problem consists of cutting a set of convex and non-convex two-dimensional polygonal pieces from a board with a fixed height and infinite length. Owing to the importance of this problem, a large ...
Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
This paper addresses the non-preemptive single machine scheduling problem to minimize total tardiness. We are interested in the online version of this problem, where orders arrive at the system at random times. Jobs have ...
A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem
(Pergamon-elsevier Science LtdOxfordInglaterra, 2014)
Nonlinear cutting stock problem model to minimize the number of different patterns and objects
(Sociedade Brasileira de Matemática Aplicada e Computacional, 2008)
Heuristic algorithm to solve the short term transmission network expansion planning
In this paper, a method for solving the short term transmission network expansion planning problem is presented. This is a very complex mixed integer nonlinear programming problem that presents a combinatorial explosion ...
An integer programming approach to curriculum-based examination timetabling
The examination timetabling problem (ETTP) consists in the assignment of specific dates to the exams of a set of courses assuming that the course enrollments are known. This problem is also known as post-enrollment ETTP. ...