Toggle navigation
Logout
Change account settings
EN
DE
ES
FR
A-Z
Beta
About EconBiz
News
Thesaurus (STW)
Research Skills
Help
EN
DE
ES
FR
My account
Logout
Change account settings
Login
Publications
Events
Your search terms
Search
Retain my current filters
~subject:"Branch and Bound"
Search options
All Fields
Title
Exact title
Subject
Author
Institution
ISBN/ISSN
Published in...
Publisher
Open Access only
Advanced
Search history
My EconBiz
Favorites
Loans
Reservations
Fines
You are here:
Home
Metaheuristics for the Minimum...
Similar by person
Narrow search
Delete all filters
| 1 applied filter
Year of publication
From:
To:
Subject
All
Branch and Bound
Mathematical programming
13
Theorie
13
Theory
13
Mathematische Optimierung
12
Heuristics
8
Heuristik
8
Tourenplanung
8
Vehicle routing problem
8
Scheduling problem
6
Scheduling-Verfahren
6
Tabu Search
5
Branch-and-Bound
3
Graph partitioning
3
Hedonic price index
3
Hedonischer Preisindex
3
Operations Research
3
Operations research
3
Routing
3
Algorithm
2
Algorithmus
2
Alternative fuel vehicles
2
Binary quadratic programming
2
Column Generation
2
Combinatorial optimization
2
Dienstleistungsinnovation
2
Dienstleistungsmanagement
2
Dispersion problems
2
Dynamic programming
2
Dynamische Optimierung
2
Electric vehicle
2
Elektrofahrzeug
2
GRASP
2
Graph theory
2
Graphentheorie
2
Greedy Randomized Adaptive Search Procedure
2
Mixed integer linear programming
2
Service innovation
2
Service management
2
Share Economy
2
more ...
less ...
Online availability
All
Undetermined
1
Type of publication
All
Article
3
Type of publication (narrower categories)
All
Article in journal
3
Aufsatz in Zeitschrift
3
Language
All
English
3
Author
All
Cordone, Roberto
3
Righini, Giovanni
2
Gandellini, Federico
1
Hosteins, Pierre
1
Trubian, Marco
1
Published in...
All
Asia Pacific journal of operational research : APJOR
1
Computers & operations research : and their applications to problems of world concern ; an international journal
1
INFORMS journal on computing : JOC
1
Source
All
ECONIS (ZBW)
3
Showing
1
-
3
of
3
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
A relax-and-cut algorithm for the Knapsack Node Weighted Steiner Tree Problem
Cordone, Roberto
;
Trubian, Marco
- In:
Asia Pacific journal of operational research : APJOR
25
(
2008
)
3
,
pp. 373-391
Persistent link: https://www.econbiz.de/10003765910
Saved in:
2
Solving the swath segment selection problem through Lagrangean relaxation
Cordone, Roberto
;
Gandellini, Federico
;
Righini, Giovanni
- In:
Computers & operations research : and their …
35
(
2008
)
3
,
pp. 854-862
Persistent link: https://www.econbiz.de/10003669707
Saved in:
3
A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization
Cordone, Roberto
;
Hosteins, Pierre
;
Righini, Giovanni
- In:
INFORMS journal on computing : JOC
30
(
2018
)
1
,
pp. 168-180
Persistent link: https://www.econbiz.de/10011848225
Saved in:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
