I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Efficient Algorithms for Routing Problems with Specific Con..:
Khachai, Daniil
NNT: 2023BORD0346. , 2023
Link:
https://theses.hal.science/tel-04372176
RT Journal T1
Efficient Algorithms for Routing Problems with Specific Constraints ; Algorithmes efficaces pour les problèmes de routage avec des contraintes spécifiques
UL https://suche.suub.uni-bremen.de/peid=base-ftccsdartic:oai:HAL:tel-04372176v1&Exemplar=1&LAN=DE A1 Khachai, Daniil PB HAL CCSD YR 2023 K1 Precedence Constrained Generalized Traveling Salesman Problem K1 Integer programming K1 Branch-And-Cut algorithm K1 Facet-inducing inequalities K1 Polyhedral structure K1 Cutting Path Problem K1 Endpoint Cutting Problem K1 Adaptive Large Neighborhood Search K1 Capacitated Vehicle Routing Problem K1 Quasi-Polynomial Time Approximation Scheme K1 Problème du voyageur de commerce généralisé avec contraintes de précédence K1 Programmation en nombres entiers K1 Algorithme Branch-And-Cut K1 Inégalités valides et facettes K1 Structure polyédrique K1 Problème de chemin de coupe K1 Problème de coupe du point final K1 ALNS K1 Problème de tournées de véhicules avec capacité K1 Schéma d'approximation en temps quasi-polynomial K1 [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS] JF NNT: 2023BORD0346 LK http://dx.doi.org/https://theses.hal.science/tel-04372176 DO https://theses.hal.science/tel-04372176 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)