X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (1089) 1089
Publication (130) 130
Conference Proceeding (81) 81
Dissertation (32) 32
Book Chapter (25) 25
Book / eBook (1) 1
Magazine Article (1) 1
Paper (1) 1
Report (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
operations research & management science (602) 602
algorithms (415) 415
mathematics, applied (377) 377
cutting planes (369) 369
optimization (362) 362
integer programming (235) 235
studies (228) 228
mathematics (217) 217
analysis (203) 203
algorithm (182) 182
cutting plane method (148) 148
linear programming (144) 144
cutting plane (139) 139
mathematical models (136) 136
computer science, software engineering (122) 122
combinatorics (112) 112
operations research (112) 112
mathematical analysis (110) 110
cutting (108) 108
cutting plane algorithm (103) 103
methods (103) 103
computer science, interdisciplinary applications (101) 101
management (91) 91
planes (90) 90
inequalities (89) 89
operations research/decision theory (88) 88
numerical analysis (84) 84
usage (83) 83
mathematics of computing (82) 82
computer science (76) 76
mathematical methods in physics (76) 76
mathematical optimization (75) 75
facets (73) 73
decomposition (69) 69
models (69) 69
calculus of variations and optimal control; optimization (68) 68
cutting-plane method (68) 68
cutting plane methods (67) 67
mathematical programming (65) 65
programs (65) 65
global optimization (64) 64
research (64) 64
operation research/decision theory (62) 62
column generation (60) 60
convergence (60) 60
management science (56) 56
economics / management science (55) 55
integers (55) 55
engineering, industrial (54) 54
theory of computation (54) 54
engineering, electrical & electronic (49) 49
approximation (47) 47
heuristics (47) 47
programming (47) 47
theoretical, mathematical and computational physics (45) 45
combinatorial optimization (44) 44
computation (44) 44
valid inequalities (41) 41
nonlinear programming (40) 40
polyhedra (40) 40
branch-and-cut (39) 39
90c11 (38) 38
networks (38) 38
stochastic programming (38) 38
branch (37) 37
polytopes (37) 37
scheduling (37) 37
traveling salesman problem (37) 37
computer science, general (35) 35
formulations (35) 35
convex programming (34) 34
mixed integer programming (34) 34
bundle methods (33) 33
computer science, hardware & architecture (32) 32
cutting plane algorithms (32) 32
cutting-plane methods (32) 32
mathematical and computational physics (32) 32
model (32) 32
real functions (32) 32
uncertainty (32) 32
analytic center (31) 31
computer science, artificial intelligence (31) 31
convex and discrete geometry (31) 31
90c10 (30) 30
optimal solutions (30) 30
separation (30) 30
computer simulation (29) 29
constraints (29) 29
polyhedrons (28) 28
90c57 (27) 27
automation & control systems (27) 27
calculus of variations and optimal control (27) 27
lagrangian relaxation (27) 27
mixed-integer programming (27) 27
benders decomposition (26) 26
complexity (26) 26
complexity analysis (26) 26
cuts (26) 26
gomory cuts (26) 26
graphs (26) 26
more...
Language Language
Language Language
X
Sort by Item Count (A-Z)
Filter by Count
English (1152) 1152
Chinese (31) 31
Japanese (11) 11
French (2) 2
Portuguese (2) 2
Indonesian (1) 1
Spanish (1) 1
more...
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Journal of Machine Learning Research, ISSN 1532-4435, 2010, Volume 11, pp. 311 - 365
Journal Article
Operations Research Letters, ISSN 0167-6377, 09/2013, Volume 41, Issue 5, pp. 457 - 461
In this paper, we present a column-and-constraint generation algorithm to solve two-stage robust optimization problems. Compared with existing Benders-style... 
Cutting plane algorithm | Location-and-transportation | Two-stage robust optimization | Location-and- transportation | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | Analysis | Methods | Algorithms | Cutting | Operations research | Planes | Computation | Feasibility | Optimization
Journal Article
Computational Optimization and Applications, ISSN 0926-6003, 12/2007, Volume 38, Issue 3, pp. 371 - 399
Journal Article
Automatica, ISSN 0005-1098, 2011, Volume 47, Issue 7, pp. 1279 - 1293
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 2011, Volume 209, Issue 1, pp. 63 - 72
Journal Article
Automatica, ISSN 0005-1098, 02/2015, Volume 52, pp. 160 - 172
In this paper, we study randomized methods for feedback design of uncertain systems. The first contribution is to derive the sample complexity of various... 
Randomized and probabilistic algorithms | Uncertain systems | Sample complexity | ROBUST-CONTROL | FEASIBILITY | PROBABILISTIC SOLUTIONS | OPTIMIZATION | CUTTING PLANE METHOD | AUTOMATION & CONTROL SYSTEMS | ENGINEERING, ELECTRICAL & ELECTRONIC | Analysis | Methods | Algorithms
Journal Article
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, ISSN 0377-2217, 06/2019, Volume 275, Issue 3, pp. 822 - 829
The cutting-plane optimization methods rely on the idea that any subgradient of the objective function or the active/violated constraints defines a halfspace... 
Pseudoconvex functions | Cutting-plane method | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | CONVEX | Multiple objective programming | Subdifferencial | Nonsmooth optimization | ELLIPSOID ALGORITHM
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 06/2019, Volume 275, Issue 3, pp. 822 - 829
The cutting-plane optimization methods rely on the idea that any subgradient of the objective function or the active/violated constraints defines a halfspace... 
Pseudoconvex functions | Subdifferencial | Cutting-plane method | Nonsmooth optimization | Multiple objective programming | Linear programming | Usage | Management science | Mathematical optimization | Analysis
Journal Article
Journal of Machine Learning Research, ISSN 1532-4435, 12/2012, Volume 13, pp. 3539 - 3583
Machine learning is most often cast as an optimization problem. Ideally, one expects a convex objective function to rely on efficient convex optimizers with... 
Non-convex | Non-smooth | Regularized risk | Cutting plane | Optimization | Bundle method | non-convex | optimization | regularized risk | non-smooth | cutting plane | AUTOMATION & CONTROL SYSTEMS | COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE | bundle method
Journal Article
Central European Journal of Operations Research, ISSN 1435-246X, 12/2015, Volume 23, Issue 4, pp. 877 - 898
In case of a special problem class, the simplex method can be implemented as a cutting-plane method that approximates a polyhedral convex objective function.... 
Cutting-plane methods | Business and Management | Simplex method | Linear programming | Operation Research/Decision Theory | Convex programming | Regularization | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | DECOMPOSITION METHOD | BUNDLE METHODS | ALGORITHM | CUTTING-PLANE METHOD | Studies | Operations research | Mathematical models | Algorithms | Approximation | Pricing
Journal Article
Journal Article