The following pages link to Antonio Frangioni (Q210509):
Displayed 50 items.
- Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
- A stabilized structured Dantzig-Wolfe decomposition method (Q359629) (← links)
- (Q547134) (redirect page) (← links)
- Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE (Q547138) (← links)
- On interval-subgradient and no-good cuts (Q613320) (← links)
- Static and dynamic routing under disjoint dominant extreme demands (Q631210) (← links)
- Accelerated multigrid for graph Laplacian operators (Q670780) (← links)
- Dynamic smoothness parameter for fast gradient methods (Q683921) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes (Q833581) (← links)
- Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems (Q895654) (← links)
- On the choice of explicit stabilizing terms in column generation (Q1025985) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- On a new class of bilevel programming problems and its use for reformulating mixed integer problems (Q1388924) (← links)
- Delay-constrained routing problems: accurate scheduling models and admission control (Q1652220) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- Improving the approximated projected perspective reformulation by dual information (Q1728322) (← links)
- Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems (Q1768611) (← links)
- A storm of feasibility pumps for nonconvex MINLP (Q1925794) (← links)
- Beyond canonical dc-optimization: the single reverse polar problem (Q1935286) (← links)
- A Lagrangian approach to chance constrained routing with local broadcast (Q2056917) (← links)
- Start-up/shut-down MINLP formulations for the unit commitment with ramp constraints (Q2056921) (← links)
- A constraints-aware reweighted feasibility pump approach (Q2060346) (← links)
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301) (← links)
- A MILP approach to DRAM access worst-case analysis (Q2147044) (← links)
- Quasi-separable Dantzig-Wolfe reformulations for network design (Q2225066) (← links)
- Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
- Outer approximation algorithms for canonical DC problems (Q2269586) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Strengthening the sequential convex MINLP technique by perspective reformulations (Q2311102) (← links)
- Delay-constrained shortest paths: approximation algorithms and second-order cone models (Q2342143) (← links)
- Large-scale unit commitment under uncertainty (Q2351161) (← links)
- A library for continuous convex separable quadratic knapsack problems (Q2355800) (← links)
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support (Q2374364) (← links)
- Perspective cuts for a class of convex 0-1 mixed integer programs (Q2490334) (← links)
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms (Q2564758) (← links)
- New approaches for optimizing over the semimetric polytope (Q2576727) (← links)
- Prim-based support-graph preconditioners for min-cost flow problems (Q2643617) (← links)
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP (Q2643791) (← links)
- A multiperiod drayage problem with customer-dependent service periods (Q2668610) (← links)
- Spectral Analysis of (Sequences of) Graph Matrices (Q2784350) (← links)
- A Nonmonotone Proximal Bundle Method with (Potentially) Continuous Step Decisions (Q2866207) (← links)
- Projected Perspective Reformulations with Applications in Design Problems (Q2879518) (← links)
- Symmetric and Asymmetric Parallelization of a Cost-Decomposition Algorithm for Multicommodity Flow Problems (Q2884565) (← links)
- A Computational Study of Cost Reoptimization for Min-Cost Flow Problems (Q2892272) (← links)
- Bicriteria Data Compression: Efficient and Usable (Q2921426) (← links)
- Perspective Reformulations of the CTA Problem with <i>L</i><sub>2</sub> Distances (Q2931708) (← links)
- Piecewise-quadratic Approximations in Convex Numerical Optimization (Q3225237) (← links)
- Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints (Q3392019) (← links)