Skip to Main content Skip to Navigation
 

Search

MAORE

  Methods, Algorithms for Operations REsearch

Consult your copyright

Number of Files

182

Nomber of Notices

89

Collaborations’ map

Tags

Vehicle routing Degree-Constrained Spanning Problem Réseaux de capteurs FPTAS Checkpointing Optimisation Optimisation combinatoire Wireless sensor networks K-Adaptability Approximation Spanning tree All-optical WDM networks ILP MBVST Parallel job Cutting plane Free space optics Wavelength minimization Integer Linear Programming ILP Matching Complexity Approximation algorithms Localisation Light-tree K-MBVST Spanning Hierarchy Scheduling Bi-level programming IoT Exascale Capacity Expansion Homomorphisme Light-trail Multicommodity flows Constrained shortest path K-adaptability Quality of service Column Generation Hierarchy Clearing algorithms Compatibility graph Branch and Price Network design Approximability Complexity & approximation Constraint programming Heuristic Replication Lot-sizing Branch-and-Cut RPL Time windows Model Driven Engineering Branch vertices constraint Energy-aware engineering Benders decomposition Degree constrained minimum spanning hierarchy Lifetime MODEL-CHECKING Routing MILP Scaffolding Integer Programming Bass model FPT algorithm Optimization Homomorphism Integer programming Path generation Spanning problems Light-hierarchy Coupled-task scheduling model Makespan minimization Graph theory Multicast routing Kidney exchange Longest path Budgeted uncertainty Robust optimization Complexité Chordal graphs Linear programming Fault-tolerance Lot-sizing problem Column generation Investments optimization Layered formulation Combinatorial optimization WDM network Coupled-tasks Dynamic programming Linear and mixed-integer programming Robust Optimization Approximation ratio FSO Affine routing Sparse splitting Variable link capacity Approximation algorithm Light-forest