Skip to Main content Skip to Navigation
 

Search

MAORE

  Methods, Algorithms for Operations REsearch

Consult your copyright

Number of Files

164

Nomber of Notices

86

Collaborations’ map

Tags

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