| Nome |
# |
|
On the Computational Efficiency of Subgradient Methods: a Case Study with Lagrangian Bounds, file e0d6c928-fbd0-fcf8-e053-d805fe0aa794
|
357
|
|
Incremental bundle methods using upper models, file e0d6c92a-876f-fcf8-e053-d805fe0aa794
|
256
|
|
Large-scale Unit Commitment Under Uncertainty: an Updated Literature Survey, file e0d6c92a-dab7-fcf8-e053-d805fe0aa794
|
232
|
|
Statistically Sound Experiments with OpenAirInterface Cloud-RAN Prototypes, file e0d6c927-7c6d-fcf8-e053-d805fe0aa794
|
229
|
|
Inexact Stabilized Benders' Decomposition Approaches, with Application to Chance-Constrained Problems with Finite Support, file e0d6c927-6f7a-fcf8-e053-d805fe0aa794
|
226
|
|
Large-scale Unit Commitment under uncertainty, file e0d6c926-424c-fcf8-e053-d805fe0aa794
|
220
|
|
QoS Routing with worst-case delay constraints: models, algorithms and performance analysis, file e0d6c927-b979-fcf8-e053-d805fe0aa794
|
196
|
|
A Stabilized Structured Dantzig-Wolfe Decomposition Method, file e0d6c92c-d18f-fcf8-e053-d805fe0aa794
|
180
|
|
Comparing Spatial and Scenario Decomposition for Stochastic Hydrothermal Unit Commitment Problems, file e0d6c929-ea0a-fcf8-e053-d805fe0aa794
|
175
|
|
Perspective cuts for a class of convex 0–1 mixed integer programs, file e0d6c92d-3c45-fcf8-e053-d805fe0aa794
|
164
|
|
Delay-constrained shortest paths: approximation algorithms and second-order cone models, file e0d6c927-c37e-fcf8-e053-d805fe0aa794
|
155
|
|
Minimizing power consumption in virtualized cellular networks, file e0d6c92a-5341-fcf8-e053-d805fe0aa794
|
152
|
|
A matheuristic for integrated timetabling and vehicle scheduling, file e0d6c930-8ee0-fcf8-e053-d805fe0aa794
|
145
|
|
Accelerated Multigrid for Graph Laplacian Operators, file e0d6c926-87a2-fcf8-e053-d805fe0aa794
|
138
|
|
Computational Evaluation of Multi-Iterative Approaches for Solving Graph-Structured Large Linear Systems, file e0d6c928-5f5d-fcf8-e053-d805fe0aa794
|
129
|
|
Generalized Bundle Methods for Sum-Functions with "Easy" Components: Applications to Multicommodity Network Design, file e0d6c92d-259a-fcf8-e053-d805fe0aa794
|
125
|
|
About Lagrangian Methods in Integer Optimization, file e0d6c92c-e1d5-fcf8-e053-d805fe0aa794
|
121
|
|
Dynamic Smoothness Parameter for Fast Gradient Methods, file e0d6c929-7233-fcf8-e053-d805fe0aa794
|
109
|
|
A set-covering formulation for a drayage problem with single and double container loads, file e0d6c92a-2df3-fcf8-e053-d805fe0aa794
|
109
|
|
Approximated Perspective Relaxations: a Project&Lift Approach, file e0d6c926-80c4-fcf8-e053-d805fe0aa794
|
106
|
|
Delay-constrained Routing Problems: Accurate Scheduling Models and Admission Control, file e0d6c928-5cd1-fcf8-e053-d805fe0aa794
|
102
|
|
QPLIB: A Library of Quadratic Programming Instances, file e0d6c92b-72f0-fcf8-e053-d805fe0aa794
|
102
|
|
Strengthening the Sequential Convex MINLP Technique by Perspective Reformulations, file e0d6c92b-5df9-fcf8-e053-d805fe0aa794
|
98
|
|
Improving the Approximated Projected Perspective Reformulation by Dual Information, file e0d6c929-8cc6-fcf8-e053-d805fe0aa794
|
94
|
|
A Price-and-Branch Algorithm for a Drayage Problem with Heterogeneous Trucks, file e0d6c92a-aded-fcf8-e053-d805fe0aa794
|
94
|
|
Standard Bundle Methods: Untrusted Models and Duality, file e0d6c92e-be34-fcf8-e053-d805fe0aa794
|
89
|
|
Learning to Configure Mathematical Programming Solvers by Mathematical Programming, file e0d6c92f-60ee-fcf8-e053-d805fe0aa794
|
89
|
|
Towards Robust Admission Control in Delay-Constrained Routing Problems, file e0d6c92a-bee5-fcf8-e053-d805fe0aa794
|
85
|
|
A Nonmonotone Proximal Bundle Method With (Potentially) Continuous Step Decisions, file e0d6c926-3842-fcf8-e053-d805fe0aa794
|
84
|
|
Projected Perspective Reformulations with Applications in Design Problems, file e0d6c92c-f99f-fcf8-e053-d805fe0aa794
|
73
|
|
Bicriteria Data Compression, file e0d6c92e-1073-fcf8-e053-d805fe0aa794
|
64
|
|
Solving Stochastic Hydrothermal Unit Commitment with a New Primal Recovery Technique Based on Lagrangian Solutions, file e0d6c92f-bfbb-fcf8-e053-d805fe0aa794
|
59
|
|
A Computational Study of Cost Reoptimization for Min Cost Flow Problems, file e0d6c92d-3626-fcf8-e053-d805fe0aa794
|
56
|
|
Linear Programming Models for Traffic Engineering in 100% Survivable Networks under combined IS-IS/OSPF and MPLS-TE Protocols, file e0d6c92d-2126-fcf8-e053-d805fe0aa794
|
55
|
|
A Tool for Practical Integrated Time-Table Design and Vehicle Scheduling in Public Transport Systems, file e0d6c931-9058-fcf8-e053-d805fe0aa794
|
55
|
|
Beyond canonical DC-Optimization: the single reverse polar problem, file e0d6c92c-823c-fcf8-e053-d805fe0aa794
|
53
|
|
Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs, file e0d6c92d-dbae-fcf8-e053-d805fe0aa794
|
53
|
|
On Interval-subgradient and No-good Cuts, file e0d6c92d-3caa-fcf8-e053-d805fe0aa794
|
52
|
|
Start-up/Shut-down MINLP Formulations for the Unit Commitment with Ramp Constraints, file e0d6c930-1680-fcf8-e053-d805fe0aa794
|
51
|
|
Solving Unit Commitment Problems with General Ramp Contraints, file e0d6c92d-3cb0-fcf8-e053-d805fe0aa794
|
49
|
|
A Learning-based Mathematical Programming Formulation for the Automatic Configuration of Optimization Solvers, file e0d6c931-733d-fcf8-e053-d805fe0aa794
|
49
|
|
A Multiperiod Drayage Problem with Customer-dependent Service Periods, file e0d6c92f-db46-fcf8-e053-d805fe0aa794
|
44
|
|
SDP Diagonalizations and Perspective Cuts for a Class of Nonseparable MIQP, file e0d6c92c-d097-fcf8-e053-d805fe0aa794
|
40
|
|
A Computational Comparison of Reformulations of the Perspective Relaxation: SOCP vs. Cutting Planes, file e0d6c92d-18a8-fcf8-e053-d805fe0aa794
|
39
|
|
Experiments with Hybrid Interior Point/Combinatorial Approaches for Network Flow Problems, file e0d6c92d-24a6-fcf8-e053-d805fe0aa794
|
37
|
|
0-1 Reformulations of the Multicommodity Capacitated Network Design Problem, file e0d6c92d-25a5-fcf8-e053-d805fe0aa794
|
37
|
|
Stabilized Benders Methods for Large-Scale Combinatorial Optimization, with Application to Data Privacy, file e0d6c92e-5c3a-fcf8-e053-d805fe0aa794
|
37
|
|
Prim-based Support-Graph Preconditioners for Min-Cost Flow Problems, file e0d6c92c-fbe2-fcf8-e053-d805fe0aa794
|
36
|
|
Bicriteria data compression, file e0d6c92c-339c-fcf8-e053-d805fe0aa794
|
35
|
|
Static and Dynamic Routing Under Disjoint Dominant Extreme Demands, file e0d6c92d-3300-fcf8-e053-d805fe0aa794
|
35
|
|
A Lagrangian approach to Chance Constrained Routing with Local Broadcast, file e0d6c930-589e-fcf8-e053-d805fe0aa794
|
35
|
|
Piecewise Quadratic Approximations in Convex Numerical Optimization, file e0d6c92d-2129-fcf8-e053-d805fe0aa794
|
33
|
|
Special issue of EURO Journal on Computational Optimization on "Nonlinear and Combinatorial Methods for Energy Optimization", file e0d6c92a-08a0-fcf8-e053-d805fe0aa794
|
32
|
|
New Preconditioners for KKT Systems of Network Flow Problems, file e0d6c92c-fbe4-fcf8-e053-d805fe0aa794
|
32
|
|
Spectral Analysis of (Sequences of) Graph Matrices, file e0d6c92d-37dd-fcf8-e053-d805fe0aa794
|
32
|
|
Special issue on “Convex Analysis, Optimization and Applications”, file e0d6c92c-d186-fcf8-e053-d805fe0aa794
|
31
|
|
On the Choice of Explicit Stabilizing Terms in Column Generation, file e0d6c92c-d34e-fcf8-e053-d805fe0aa794
|
30
|
|
New approaches for optimizing over the semimetric polytope, file e0d6c92d-3627-fcf8-e053-d805fe0aa794
|
30
|
|
Tighter Approximated MILP Formulations for Unit Commitment Problems, file e0d6c92c-ef70-fcf8-e053-d805fe0aa794
|
29
|
|
Convergence Analysis of Deflected Conditional Approximate Subgradient Methods, file e0d6c92c-f26c-fcf8-e053-d805fe0aa794
|
29
|
|
Generalized Bundle Methods, file e0d6c92d-157a-fcf8-e053-d805fe0aa794
|
29
|
|
A Storm of Feasibility Pumps for Nonconvex MINLP, file e0d6c92c-ecc8-fcf8-e053-d805fe0aa794
|
28
|
|
Perspective Reformulations of the CTA Problem with L_2 Distances, file e0d6c931-a5d6-fcf8-e053-d805fe0aa794
|
28
|
|
Practical feasibility, scalability and effectiveness of coordinated scheduling algorithms in cellular networks towards 5G, file e0d6c92c-aecf-fcf8-e053-d805fe0aa794
|
25
|
|
Flexible dynamic Coordinated Scheduling in Virtual-RAN deployments, file e0d6c92c-8062-fcf8-e053-d805fe0aa794
|
21
|
|
A testbed for flexible and energy-efficient resource management with virtualized LTE-A nodes, file e0d6c92c-7f08-fcf8-e053-d805fe0aa794
|
16
|
|
Optimal joint path computation and rate allocation for real-time traffic, file e0d6c92c-b825-fcf8-e053-d805fe0aa794
|
14
|
|
Outer Approximation Algorithms for Canonical DC Problems, file e0d6c92c-83f1-fcf8-e053-d805fe0aa794
|
11
|
|
Approximate optimality conditions and stopping criteria in canonical DC programming, file e0d6c92c-b341-fcf8-e053-d805fe0aa794
|
11
|
|
Scalability and energy efficiency of Coordinated Scheduling in cellular networks towards 5G, file e0d6c92c-c384-fcf8-e053-d805fe0aa794
|
10
|
|
Towards Robust Admission Control in Delay-Constrained Routing Problems, file e0d6c92c-b12e-fcf8-e053-d805fe0aa794
|
5
|
|
Node-Based Lagrangian Relaxations for Multicommodity Capacitated Fixed-Charge Network Design, file e0d6c92f-ea7d-fcf8-e053-d805fe0aa794
|
5
|
|
QoS Routing with worst-case delay constraints: models, algorithms and performance analysis, file e0d6c92c-6f93-fcf8-e053-d805fe0aa794
|
4
|
|
A testbed for flexible and energy-efficient resource management with virtualized LTE-A nodes, file e0d6c92c-7159-fcf8-e053-d805fe0aa794
|
4
|
|
Practical feasibility, scalability and effectiveness of coordinated scheduling algorithms in cellular networks towards 5G, file e0d6c92c-822b-fcf8-e053-d805fe0aa794
|
4
|
|
Pairwise Compatibility Graphs of Caterpillars, file e0d6c92c-e676-fcf8-e053-d805fe0aa794
|
4
|
|
Approximate optimality conditions and stopping criteria in canonical DC programming, file e0d6c926-0876-fcf8-e053-d805fe0aa794
|
3
|
|
Beyond canonical DC-Optimization: the single reverse polar problem, file e0d6c926-243f-fcf8-e053-d805fe0aa794
|
3
|
|
Scalability and energy efficiency of Coordinated Scheduling in cellular networks towards 5G, file e0d6c929-5e61-fcf8-e053-d805fe0aa794
|
3
|
|
Flexible dynamic Coordinated Scheduling in Virtual-RAN deployments, file e0d6c92c-7163-fcf8-e053-d805fe0aa794
|
3
|
|
Quasi-Separable Dantzig-Wolfe Reformulations for Network Design, file e0d6c931-c05a-fcf8-e053-d805fe0aa794
|
3
|
|
A MILP Approach to DRAM Access Worst-Case Analysis, file e0d6c932-01b7-fcf8-e053-d805fe0aa794
|
3
|
|
Minimizing power consumption in virtualized cellular networks, file e0d6c92c-6f7f-fcf8-e053-d805fe0aa794
|
2
|
|
Optimal sizing of energy communities with fair revenue sharing and exit clauses: Value, role and business model of aggregators and users, file e0d6c931-6e2c-fcf8-e053-d805fe0aa794
|
2
|
|
Optimal joint path computation and rate allocation for real-time traffic, file e0d6c92c-7023-fcf8-e053-d805fe0aa794
|
1
|
|
Delay-constrained Routing Problems: Accurate Scheduling Models and Admission Control, file e0d6c92c-7e91-fcf8-e053-d805fe0aa794
|
1
|
|
Outer Approximation Algorithms for Canonical DC Problems, file e0d6c92c-b347-fcf8-e053-d805fe0aa794
|
1
|
|
Statistically Sound Experiments with OpenAirInterface Cloud-RAN Prototypes, file e0d6c931-58a1-fcf8-e053-d805fe0aa794
|
1
|
|
A Constraints-Aware Reweighted Feasibility Pump Approach, file e0d6c931-9684-fcf8-e053-d805fe0aa794
|
1
|
|
Piecewise Linear Cost Network Design, file e0d6c931-9c43-fcf8-e053-d805fe0aa794
|
1
|
| Totale |
5930 |