Revue francaise d'automatique, d'informatique et de recherche operationnelle. Recherche operationnelle

Visão geral
Metrics
Identidade
Ver todos

Qualis

B1

código do país

FR

tipo

journal

publicação venue de

A biased random-key genetic algorithm for the chordal completion problem. 57:1559-1578. 2023-01-01
A parallel lagrangian heuristic for the fractional chromatic number of a graph. 1:1-1841. 2023-01-01
Algorithms for the genome median under a restricted measure of rearrangement. 57:1045-1058. 2023-01-01
Arc-flow formulations for the one-dimensional cutting stock problem with multiple manufacturing modes. 57:183-200. 2023-01-01
Branch-and-cut algorithms for the covering salesman problem. 57:1149-1166. 2023-01-01
Computing role assignments of Cartesian product of graphs. 57:1075-1086. 2023-01-01
Inventory management through one step ahead optimal control based on linear programming. 57:17-42. 2023-01-01
Mathematical models for the cutting stock with limited open stacks problem . 57:2067-2085. 2023-01-01
Steane code analysis by randomized benchmarking. 57:905-912. 2023-01-01
Computing some role assignments of Cartesian product of graphs. 56:115-121. 2022-01-01
Evaluating process flexibility in lot sizing problems: an approach based on multicriteria decision making. 56:3187-3217. 2022-01-01
Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty. 56:4281-4301. 2022-01-01
Hybrid matheuristics for the multi-capacitated clustering problem. 1-23. 2022-01-01
Restricted Hamming-Huffman trees. 56:1823-1839. 2022-01-01
The effective BRKGA algorithm for the k -medoids clustering problem. 56:3137-3153. 2022-01-01
The widest k-set of disjoint paths problem. 57:87-97. 2022-01-01
UAVs routes optimization on smart cities and regions. 56:853-869. 2022-01-01
A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy. 55:S741-S763. 2021-01-01
A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem. 55:S719-S726. 2021-01-01
A conjecture on a continuous optimization model for the Golomb Ruler Problem. 55:2241-2246. 2021-01-01
A matheuristic approach for the maximum balanced subgraph of a signed graph. 55:3121-3140. 2021-01-01
An ils-based heuristic applied to the car renter salesman problem. 55:1-22. 2021-01-01
Designing screen layout in multimedia applications through integer programming and metaheuristic. 55:3379-3397. 2021-01-01
Exact and approximate algorithms for the longest induced path problem. 55:333-353. 2021-01-01
Flow routing aiming load balancing and path length in multi-hop networks with different link qualities. 55:2631-2637. 2021-01-01
Heuristic approach applied to the optimum stratification problem. 55:979-996. 2021-01-01
Improved robust shortest paths by penalized investments. 55:1865-1883. 2021-01-01
Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy. 55:2247-2264. 2021-01-01
Optimization models for a lot sizing and scheduling problem on parallel production lines that share scarce resources. 55:1949-1970. 2021-01-01
Reactive GRASP for the prize-collecting covering tour problem. 55:1441-1457. 2021-01-01
The Integrated Cutting and Packing Heterogeneous Precast Beams Multiperiod Production Planning Problem. 55:2491-2524. 2021-01-01
The integrated uncapacitated lot sizing and bin packing problem. 55:1197-1212. 2021-01-01
Using multiflow formulations to solve the Steiner tree problem in graphs. 55:S343-S350. 2021-01-01
A heuristic for the minimum cost chromatic partition problem. 54:845-871. 2020-01-01
A model for pandemic control through isolation policy. 6:1-1. 2020-01-01
A new penalty/stochastic approach to an application of the covering problem: The gamma knife treatment. 55:S787-S810. 2020-01-01
An inexact proximal decomposition method for variational inequalities with separable structure. 55:S873-S884. 2020-01-01
Integer and constraint programming approaches for providing optimality to the bandwidth multicoloring problem. 55:S1949-S1967. 2020-01-01
New proposals for modelling and solving the problem of covering solids using spheres of different radii. 54:873-882. 2020-01-01
On the geodetic hull number for complementary prisms II. 1:1-17. 2020-01-01

tem uma área de assunto

publisher

EDP Sciences

is open access

False invalid format

is in DOAJ

False invalid format