UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA

Operations research, 2022-05, Vol.70 (3), p.1914-1932

2022

Volltextzugriff (PDF)

Strong SOCP Relaxations for the Optimal Power Flow Problem

Operations research, 2016-11, Vol.64 (6), p.1177-1196

2016

Volltextzugriff (PDF)

Approximation Algorithms for Training One-Node ReLU Neural Networks

IEEE transactions on signal processing, 2020, Vol.68, p.6696-6706

2020

Volltextzugriff (PDF)

Theoretical challenges towards cutting-plane selection

Mathematical programming, 2018-07, Vol.170 (1), p.237-266

2018

Volltextzugriff (PDF)

Inexactness of SDP Relaxation and Valid Inequalities for Optimal Power Flow

IEEE transactions on power systems, 2016-01, Vol.31 (1), p.642-651

2016

Volltextzugriff (PDF)

Mixed-integer quadratic programming is in NP

Mathematical programming, 2017-03, Vol.162 (1-2), p.225-240

2017

Volltextzugriff (PDF)

A note on the split rank of intersection cuts

Mathematical programming, 2011-11, Vol.130 (1), p.107-124

Dey, Santanu S.

2011

Volltextzugriff (PDF)

Improving the Integer L-Shaped Method

INFORMS journal on computing, 2016-06, Vol.28 (3), p.483-499

2016

Volltextzugriff (PDF)

A Strong Dual for Conic Mixed-Integer Programs

SIAM journal on optimization, 2012-01, Vol.22 (3), p.1136-1150

2012

Volltextzugriff (PDF)

Analysis of MILP Techniques for the Pooling Problem

Operations research, 2015-03, Vol.63 (2), p.412-427

2015

Volltextzugriff (PDF)

A theoretical and computational analysis of full strong-branching

Mathematical programming, 2024-05, Vol.205 (1-2), p.303-336

2024

Volltextzugriff (PDF)

Lower bounds on the size of general branch-and-bound trees

Mathematical programming, 2023-03, Vol.198 (1), p.539-559

2023

Volltextzugriff (PDF)

Branch-and-bound solves random binary IPs in poly(n)-time

Mathematical programming, 2023-06, Vol.200 (1), p.569-587

2023

Volltextzugriff (PDF)

A reformulation-enumeration MINLP algorithm for gas network design

Journal of global optimization, 2024-09, Vol.90 (4), p.931-963

2024

Volltextzugriff (PDF)

Solving sparse principal component analysis with global support

Mathematical programming, 2023-05, Vol.199 (1-2), p.421-459

2023

Volltextzugriff (PDF)

Relaxations and discretizations for the pooling problem

Journal of global optimization, 2017-03, Vol.67 (3), p.631-669

2017

Volltextzugriff (PDF)

Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs

Mathematics of operations research, 2018-02, Vol.43 (1), p.304-332

2018

Volltextzugriff (PDF)

Sparse PSD approximation of the PSD cone

Mathematical programming, 2022-02, Vol.191 (2), p.981-1004

2022

Volltextzugriff (PDF)

Approximating polyhedra with sparse inequalities

Mathematical programming, 2015-12, Vol.154 (1-2), p.329-352

2015

Volltextzugriff (PDF)

Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities

INFORMS journal on computing, 2024-05, Vol.36 (3), p.884-899

2024

Volltextzugriff (PDF)

A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching

Operations research, 2016-07, Vol.64 (4), p.922-938

2016

Volltextzugriff (PDF)

New SOCP relaxation and branching rule for bipartite bilinear programs

Optimization and engineering, 2019-06, Vol.20 (2), p.307-336

2019

Volltextzugriff (PDF)

Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions

Mathematical programming, 2017-03, Vol.162 (1-2), p.523-535

2017

Volltextzugriff (PDF)

Special Issue: Global Solution of Integer, Stochastic and Nonconvex Optimization Problems

Mathematical programming, 2022-11, Vol.196 (1-2), p.1-8

2022

Volltextzugriff (PDF)

Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem

Mathematical programming computation, 2018-12, Vol.10 (4), p.557-596

2018

Volltextzugriff (PDF)

1 – 25 von 572

Menü

Weitere Dienste

Einstellungen

Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA

Strong SOCP Relaxations for the Optimal Power Flow Problem

Approximation Algorithms for Training One-Node ReLU Neural Networks

Theoretical challenges towards cutting-plane selection

Inexactness of SDP Relaxation and Valid Inequalities for Optimal Power Flow

Mixed-integer quadratic programming is in NP

A note on the split rank of intersection cuts

Improving the Integer L-Shaped Method

A Strong Dual for Conic Mixed-Integer Programs

Analysis of MILP Techniques for the Pooling Problem

A theoretical and computational analysis of full strong-branching

Lower bounds on the size of general branch-and-bound trees

Branch-and-bound solves random binary IPs in poly(n)-time

A reformulation-enumeration MINLP algorithm for gas network design

Solving sparse principal component analysis with global support

Relaxations and discretizations for the pooling problem

Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs

Sparse PSD approximation of the PSD cone

Approximating polyhedra with sparse inequalities

Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities

A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching

New SOCP relaxation and branching rule for bipartite bilinear programs

Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions

Special Issue: Global Solution of Integer, Stochastic and Nonconvex Optimization Problems

Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem

Aktive Filter

Suchergebnisse filtern