Sciweavers

870 search results - page 5 / 174
» A New Approach to Modeling and Solving Minimal Perturbation ...
Sort
View
COCOA
2007
Springer
14 years 2 months ago
A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
Lanbo Zheng, Christoph Buchheim
AUTOMATICA
2007
103views more  AUTOMATICA 2007»
13 years 8 months ago
Lexicographic perturbation for multiparametric linear programming with applications to control
Optimal control problems for constrained linear systems with a linear cost can be posed as multiparametric linear programs with a parameter in the cost, or equivalently the right-...
Colin Neil Jones, Eric C. Kerrigan, Jan M. Maciejo...

Publication
255views
12 years 5 months ago
Ant-Q Hyper-Heuristic Approach for solving 2-Dimensional Cutting Stock Problem
Hyper-heuristics are new approaches which aim at raising the level of abstraction when solving combinatorial optimisation problems. In this paper we introduce a new hyper-heuristi...
Imen Khamassi, Moez Hammami, Khaled Ghédira
EAAI
2007
154views more  EAAI 2007»
13 years 7 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deï¬...
Ahlem Ben Hassine, Tu Bao Ho
ASIAMS
2007
IEEE
14 years 2 months ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham