Column generation and the airline crew pairing problem.
Column-generation in integer linear programming
We present an exact method for integer linear programming problems that combines branch and bound with column generation at each node of the search tree. For the case of models involving binary column vectors only, we propose the use of so-called geometrical cuts to be added to the subproblem in order to eliminate previously generated columns. This scheme could be applied to general integer problems without specific structure. We report computational results on a successful application of this approach...
Column-Generation in Integer Linear Programming
We present an exact method for integer linear programming problems that combines branch and bound with column generation at each node of the search tree. For the case of models involving binary column vectors only, we propose the use of so-called geometrical cuts to be added to the subproblem in order to eliminate previously generated columns. This scheme could be applied to general integer problems without specific structure. We report computational results on a successful application of this...
Combination of anti-optimization and fuzzy-set-based analyses for structural optimization under uncertainty.
Combination of mobile agent and evolutionary algorithm to optimize the client transport services
This paper presents a migration strategy for a set of mobile agents (MAs) in order to satisfy customers' requests in a transport network, through a multimodal information system. In this context, we propose an optimization solution which operates on two levels. The first one aims to constitute a set of MAs building their routes, called Workplans. At this level, Workplans must incorporate all nodes, representing information providers in the multimodal network, in order to explore it completely....
Combination trading with limit orders.
Combinatorial algorithms for computing column space bases that have sparse inverses.
Combinatorial Methods for Solving Problems of Optimal Portional Resource Distribution
Combinatorial optimization in DNA mapping — A computational thread of the simplified partial digest problem
In the paper, the problem of the genome mapping of DNA molecules, is presented. In particular, the new approach — the Simplified Partial Digest Problem (SPDP), is analyzed. This approach, although easy in laboratory implementation and robust with respect to measurement errors, when formulated in terms of a combinatorial search problem, is proved to be strongly NP-hard for the general error-free case. For a subproblem of the SPDP, a simple O()-time algorithm is given, where is a number of restriction...
Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem
In the paper, the problem of the genome mapping of DNA molecules, is presented. In particular, the new approach — the Simplified Partial Digest Problem (SPDP), is analyzed. This approach, although easy in laboratory implementation and robust with respect to measurement errors, when formulated in terms of a combinatorial search problem, is proved to be strongly NP-hard for the general error-free case. For a subproblem of the SPDP, a simple O(nlogn)-time algorithm is given, where n is a number of...
Combinatorial optimization in production and logistics systems
Combinatorial properties of Fourier-Motzkin elimination.
Combined relaxation methods for variational inequality problems over products sets.
Combined trust region methods for nonlinear least squares
Combining biometric fractal pattern and particle swarm optimization-based classifier for fingerprint recognition.
Combining evolutionary algorithms and exact approaches for multi-objective knowledge discovery
An important task of knowledge discovery deals with discovering association rules. This very general model has been widely studied and efficient algorithms have been proposed. But most of the time, only frequent rules are seeked. Here we propose to consider this problem as a multi-objective combinatorial optimization problem in order to be able to also find non frequent but interesting rules. As the search space may be very large, a discussion about different approaches is proposed and a hybrid...
Combining odometry and visual loop-closure detection for consistent topo-metrical mapping
We address the problem of simultaneous localization and mapping (SLAM) by combining visual loop-closure detection with metrical information given by a robot odometry. The proposed algorithm extends a purely appearance-based loop-closure detection method based on bags of visual words [A. Angeli, D. Filliat, S. Doncieux and J.-A. Meyer, IEEE Transactions On Robotics, Special Issue on Visual SLAM 24 (2008) 1027–1037], which is able to detect when the robot has returned back to a previously visited...
Combining Odometry and Visual Loop-Closure Detection for Consistent Topo-Metrical Mapping
We address the problem of simultaneous localization and mapping (SLAM) by combining visual loop-closure detection with metrical information given by a robot odometry. The proposed algorithm extends a purely appearance-based loop-closure detection method based on bags of visual words [A. Angeli, D. Filliat, S. Doncieux and J.-A. Meyer, IEEE Transactions On Robotics, Special Issue on Visual SLAM24 (2008) 1027–1037], which is able to detect when the robot has returned back to a previously visited...
Comment construire un graphe PERT minimal
Compactly epi-Lipschitzian convex sets and functions in normed spaces.