X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
branch-and-cut (579) 579
operations research & management science (551) 551
algorithms (408) 408
optimization (233) 233
integer programming (216) 216
branch and cut (189) 189
mathematics, applied (182) 182
analysis (178) 178
studies (154) 154
algorithm (145) 145
operations research (126) 126
mathematics (122) 122
computer science, interdisciplinary applications (116) 116
traveling salesman problem (115) 115
mathematical models (110) 110
inequalities (103) 103
linear programming (94) 94
transportation (90) 90
computer science (85) 85
engineering, industrial (83) 83
combinatorial optimization (82) 82
operations research/decision theory (82) 82
facets (79) 79
heuristics (78) 78
routing (78) 78
vehicles (76) 76
formulations (73) 73
combinatorics (72) 72
computer science, software engineering (72) 72
usage (71) 71
branch-and-cut algorithm (70) 70
valid inequalities (68) 68
models (66) 66
management (65) 65
networks (62) 62
transportation science & technology (62) 62
management science (61) 61
computer science, hardware & architecture (60) 60
polytope (59) 59
mathematical analysis (55) 55
graphs (54) 54
mathematics of computing (54) 54
time windows (51) 51
vehicle routing (51) 51
cut algorithm (49) 49
numerical analysis (48) 48
methods (46) 46
network design (45) 45
research (45) 45
computation (43) 43
mathematical methods in physics (42) 42
separation (42) 42
tabu search (42) 42
theory of computation (42) 42
branch (41) 41
scheduling (41) 41
benders decomposition (40) 40
heuristic (40) 40
branch‐and‐cut (39) 39
calculus of variations and optimal control; optimization (39) 39
economics / management science (39) 39
constraints (38) 38
integers (38) 38
mathematical programming (38) 38
logistics (37) 37
mathematical optimization (37) 37
vehicle-routing problem (37) 37
branch & bound algorithms (34) 34
cutting planes (34) 34
rechnerisches ergebnis (34) 34
transportation: demand, supply, and congestion, travel time, safety and accidents, transportation noise (34) 34
90c57 (33) 33
optimization techniques, programming models, dynamic analysis (33) 33
polyhedral combinatorics (33) 33
programming (31) 31
design (30) 30
graph theory (30) 30
mixed-integer programming (30) 30
search (30) 30
column generation (29) 29
vehicle routing problem (29) 29
branch-and-cut algorithms (28) 28
branch-and-cut-and-price (28) 28
model (28) 28
polyhedra (28) 28
branch-and-bound (27) 27
decomposition (27) 27
economics (27) 27
polytopes (27) 27
theoretical, mathematical and computational physics (27) 27
costs (26) 26
ganzzahlige programmierung (26) 26
operation research/decision theory (26) 26
pickup and delivery (25) 25
route selection (24) 24
telecommunications (24) 24
customers (23) 23
integer linear programming (23) 23
[ info.info-ro ] computer science [cs]/operations research [cs.ro] (22) 22
branch and bound algorithms (22) 22
more...
Library Location Library Location
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Computers and Operations Research, ISSN 0305-0548, 01/2020, Volume 113, p. 104805
The purpose of this paper is to present a new version of the One-to-One Pickup and Delivery Problem in which a single vehicle must comply with requests for... 
Incompatibility | Pickup and delivery | Branch and cut
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 09/2019
Journal Article
Operations Research Letters, ISSN 0167-6377, 09/2019, Volume 47, Issue 5, pp. 353 - 357
The most effective software packages for solving mixed 0–1linear programs use strong valid linear inequalities derived from polyhedral theory. We introduce a... 
Polyhedral combinatorics | Branch-and-cut | Mixed-integer linear programming
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 10/2019
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 09/2019
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 09/2019
Journal Article
IEEE Transactions on Power Systems, ISSN 0885-8950, 8/2019, pp. 1 - 1
Unit Commitment is usually formulated as a Mixed Binary Linear Programming (MBLP) problem. When considering a large number of units, state-of-the-art methods... 
mixed binary linear programming | formulation tightening | branch-and-cut | Unit commitment
Journal Article
Transportation science, ISSN 0041-1655, 08/2011, Volume 45, Issue 3, pp. 335 - 345
We address a vendor-managed inventory-routing problem where a supplier (vendor) receives a given amount of a single product each period and distributes it to... 
Branch-and-cut algorithm
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 09/2015, Volume 245, Issue 3, pp. 667 - 679
Bicycle sharing systems can significantly reduce traffic, pollution, and the need for parking spaces in city centers. One of the keys to success for a bicycle... 
Bicycle sharing systems | Pickup and delivery | Branch-and-cut | Multiple visits | TRAVELING SALESMAN PROBLEM | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | SERVICE | PICKUP | Combinatorial optimization | Analysis
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 07/2019
Journal Article
Computers and Operations Research, ISSN 0305-0548, 01/2020, Volume 113, p. 104795
Given a graph whose arc traversal times vary over time, the Time-Dependent Travelling Salesman Problem amounts to find a Hamiltonian tour of least total... 
Time dependence | Lower and upper bounds | Branch-and-cut | Travelling Salesman Problem
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 03/2017, Volume 219, pp. 51 - 64
This paper deals with a variant of the well-known Cluster Editing Problem (CEP), more precisely, the -CEP, in which a given input graph should be edited by... 
Cluster Editing | Branch-and-cut | Valid inequalities | MATHEMATICS, APPLIED | ALGORITHMS
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 07/2013, Volume 228, Issue 1, pp. 83 - 92
► Most papers on the TSP assume that the graph is complete. ► The Steiner TSP is a variant of the TSP defined on general graphs. ► The existing integer... 
Integer programming | Combinatorial optimization | Traveling salesman problem | GRAPH | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHM | TIME WINDOWS | BRANCH-AND-CUT | Analysis
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 06/2018, Volume 267, Issue 2, pp. 453 - 466
In this paper we address the family traveling salesman problem (FTSP), an NP-hard problem in which the set of nodes of a graph is partitioned into several... 
Traveling salesman problem | Combinatorial optimization | Metaheuristics | Branch-and-cut | Multicommodity flows | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHM | HEURISTICS
Journal Article
Transportation Research Part C, ISSN 0968-090X, 02/2013, Volume 27, pp. 89 - 107
► A hybrid rollout algorithm for an inventory routing problem is proposed. ► A supplier has to serve a set of retailers by satisfying a stochastic demand. ► An... 
Rollout algorithms | Hybrid algorithms | Inventory routing | Branch-and-cut | Stochastic demand | POLICY | APPROXIMATIONS | TRANSPORTATION SCIENCE & TECHNOLOGY | CUT ALGORITHM | Algorithms
Journal Article
Operations Research, ISSN 0030-364X, 2/2014, Volume 62, Issue 1, pp. 58 - 71
This study presents new exact algorithms for the clustered vehicle routing problem (CluVRP). The CluVRP is a generalization of the capacitated vehicle routing... 
vehicle routing | clusters | branch and cut | Clusters | Branch and cut | Vehicle routing | CUT ALGORITHM | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | MANAGEMENT | Integer programming | Usage | Combinatorial optimization | Analysis
Journal Article
INFORMS Journal on Computing, ISSN 1091-9856, 07/2019
Journal Article
Annals of Operations Research, ISSN 0254-5330, 05/2018, pp. 1 - 14
In this paper, we show a branch-and-cut approach to solve the minimum spanning tree problem with conflicting edge pairs. This is a NP-hard variant of the... 
Branch-and-cut | Conflicting edges | Minimum spanning tree | Algorithms | Branch & bound algorithms
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.