X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
branch-and-cut (585) 585
operations research & management science (565) 565
algorithms (416) 416
optimization (241) 241
integer programming (218) 218
branch and cut (188) 188
mathematics, applied (183) 183
analysis (173) 173
studies (150) 150
algorithm (149) 149
operations research (134) 134
mathematics (124) 124
computer science, interdisciplinary applications (123) 123
traveling salesman problem (113) 113
mathematical models (107) 107
inequalities (102) 102
linear programming (100) 100
computer science (99) 99
transportation (92) 92
engineering, industrial (90) 90
vehicles (84) 84
operations research/decision theory (82) 82
combinatorial optimization (81) 81
heuristics (79) 79
routing (78) 78
facets (77) 77
branch-and-cut algorithm (74) 74
formulations (74) 74
valid inequalities (73) 73
combinatorics (71) 71
usage (71) 71
computer science, software engineering (70) 70
models (66) 66
management (64) 64
networks (63) 63
transportation science & technology (62) 62
computer science, hardware & architecture (61) 61
management science (61) 61
polytope (54) 54
mathematical analysis (53) 53
mathematics of computing (53) 53
vehicle routing (53) 53
cut algorithm (52) 52
graphs (49) 49
methods (47) 47
network design (47) 47
numerical analysis (47) 47
integers (46) 46
research (45) 45
branch (44) 44
separation (44) 44
computation (43) 43
mathematical methods in physics (41) 41
theory of computation (41) 41
time windows (41) 41
benders decomposition (40) 40
branch‐and‐cut (39) 39
heuristic (39) 39
transportation: demand, supply, and congestion, travel time, safety and accidents, transportation noise (39) 39
calculus of variations and optimal control; optimization (38) 38
economics / management science (38) 38
logistics (38) 38
optimization techniques, programming models, dynamic analysis (38) 38
scheduling (38) 38
mathematical optimization (37) 37
vehicle-routing problem (37) 37
tabu search (36) 36
mathematical programming (35) 35
programming (35) 35
rechnerisches ergebnis (35) 35
branch & bound algorithms (34) 34
cutting planes (34) 34
design (34) 34
polyhedral combinatorics (34) 34
90c57 (32) 32
mixed-integer programming (32) 32
graph theory (31) 31
constraints (30) 30
branch-and-cut-and-price (29) 29
column generation (29) 29
model (29) 29
search (29) 29
vehicle routing problem (29) 29
branch-and-cut algorithms (28) 28
economics (28) 28
branch-and-bound (27) 27
ganzzahlige programmierung (26) 26
operation research/decision theory (26) 26
pickup and delivery (26) 26
polytopes (26) 26
telecommunications (26) 26
theoretical, mathematical and computational physics (26) 26
decomposition (25) 25
polyhedra (25) 25
costs (24) 24
customers (24) 24
route selection (24) 24
integer linear programming (23) 23
optimal solutions (23) 23
relaxations (23) 23
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


International Journal of Production Research, ISSN 0020-7543, 01/2016, Volume 54, Issue 2, pp. 591 - 601
Journal Article
Networks, ISSN 0028-3045, 09/2016, Volume 68, Issue 2, pp. 130 - 140
This article considers the problem of designing a two‐level network where the upper level consists of a backbone ring network connecting the so‐called hub... 
ring networks | network design | branch‐and‐cut | valid inequalities | branch-and-cut | LOCATION | SURVIVABLE NETWORKS | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | POLYHEDRA | TELECOMMUNICATIONS NETWORKS | SUBGRAPHS
Journal Article
Computers and Operations Research, ISSN 0305-0548, 2011, Volume 38, Issue 6, pp. 931 - 941
Journal Article
Computers and Operations Research, ISSN 0305-0548, 12/2012, Volume 39, Issue 12, pp. 3185 - 3199
Journal Article
Networks, ISSN 0028-3045, 07/2007, Volume 49, Issue 4, pp. 258 - 272
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given... 
pickup and delivery | branch‐and‐cut | time windows | valid inequalities | Time windows | Valid inequalities | Pickup and delivery | Branch-and-cut | TRAVELING SALESMAN PROBLEM | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | branch-and-cut
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 2009, Volume 199, Issue 3, pp. 658 - 664
Two heuristics for the 0–1 multidimensional knapsack problem (MKP) are presented. The first one uses surrogate relaxation, and the relaxed problem is solved... 
Dynamic-programming | Branch-and-cut | Surrogate relaxation | Heuristics | Multidimensional knapsack problem | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHMS | Multidimensional knapsack problem Dynamic-programming Branch-and-cut Surrogate relaxation Heuristics | Algorithms
Journal Article
Transportation Research Part B, ISSN 0191-2615, 09/2014, Volume 67, pp. 166 - 186
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 2010, Volume 200, Issue 3, pp. 711 - 724
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 09/2015, Volume 245, Issue 3, pp. 667 - 679
•A routing optimization problem arising in bicycle sharing systems is studied.•The first exact algorithm for the problem is proposed.•The underlying... 
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
Journal of the Operational Research Society, ISSN 0160-5682, 12/2007, Volume 58, Issue 12, pp. 1642 - 1651
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 07/2019
Journal Article
Networks, ISSN 0028-3045, 03/2020, Volume 75, Issue 2, pp. 137 - 157
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, 2011, Volume 210, Issue 1, pp. 27 - 38
We consider a discrete facility location problem where the difference between the maximum and minimum number of customers allocated to every plant has to be... 
Facility location | Allocation | Branch-and-cut | Integer Programming | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | OUTCOMES | EQUITY | Allocation Facility location Integer Programming Branch-and-cut
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 03/2019, Volume 256, Issue 1, pp. 11 - 37
In this paper we consider a variant of the k-separator problem. Given a graph G=(V∪T,E) with V∪T the set of vertices, where T is a set of k terminals, the... 
Vertex separator problem | Integer programming | Polytope | Separation algorithm | Branch-and-Cut algorithm | Facet | Complexity | MATHEMATICS, APPLIED | Facet Branch-and-Cut algorithm | ALGORITHMS | Formulations | Algorithms | Apexes | Inequalities | Traveling salesman problem | Graph theory | Separators | Computer Science
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 2010, Volume 203, Issue 1, pp. 205 - 215
Journal Article