Mixed-Integer Nonlinear Programming

Project: Research

Description

This is a general research area that I have been working on over the years, together with various local and international collaborators. This project is associated with a large number of papers, conference presentations and seminars.

Acronym	MINLP
Status	Active
Effective start/end date	1/10/09 → …

Letchford, Adam (Principal Investigator)
Burer, Samuel (Researcher)
Djeumou Fomeni, Franklin (Researcher)
Galli, Laura (Researcher)
Kaparis, Konstantinos (Researcher)
Zhong, Zhaoyu (PhD Student)

Datasets

OFDMA Optimisation
Dataset

Activities

17th British-French-German Optimisation Conference (BFG 2015)
Activity: Participating in or organising an event types › Participation in conference
61st Annual Conference of the Operational Research Society
Activity: Participating in or organising an event types › Participation in conference

Research outputs

The Steiner travelling salesman problem with correlated costs
Research output: Contribution to Journal/Magazine › Journal article › peer-review
A cut-and-branch algorithm for the quadratic knapsack problem
Research output: Contribution to conference - Without ISBN/ISSN › Conference paper › peer-review
Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
Research output: Contribution to Journal/Magazine › Journal article › peer-review
A new separation algorithm for the Boolean quadric and cut polytopes
Research output: Contribution to Journal/Magazine › Journal article › peer-review
A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs
Research output: Contribution to Journal/Magazine › Journal article › peer-review
A dynamic programming heuristic for the quadratic knapsack problem
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Unbounded convex sets for non-convex mixed-integer quadratic programming
Research output: Contribution to Journal/Magazine › Journal article › peer-review
On the gap inequalities for the max-cut problem
Research output: Contribution to conference - Without ISBN/ISSN › Conference paper › peer-review
Complexity results for the gap inequalities for the max-cut problem
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Gap inequalities for the max-cut problem: a cutting-plane algorithm
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review
Non-convex mixed-integer nonlinear programming: a survey
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Some unbounded convex sets arising in non-convex MIQP
Research output: Contribution to conference - Without ISBN/ISSN › Conference paper › peer-review
Gap inequalities for non-convex mixed-integer quadratic programs
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Integer quadratic quasi-polyhedra
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review
An exact algorithm for a resource allocation problem in mobile wireless communications
Research output: Contribution to Journal/Magazine › Journal article › peer-review
A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Preface: The 2013 Newton Institute programme on polynomial optimisation
Research output: Contribution to Journal/Magazine › Editorial › peer-review
A guide to conic optimisation and its applications
Research output: Contribution to Journal/Magazine › Journal article › peer-review
A heuristic for maximising energy efficiency in OFDMA systems with QoS constraints
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review
A binarisation heuristic for non-convex quadratic programming with box constraints
Research output: Contribution to Journal/Magazine › Journal article › peer-review
A heuristic for fair dynamic resource allocation in over-loaded OFDMA systems
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Using ℓ_p-norms for fairness in combinatorial optimisation
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Valid inequalities for quadratic optimisation with domain constraints
Research output: Contribution to Journal/Magazine › Journal article › peer-review

Research

Mixed-Integer Nonlinear Programming

Description

Datasets

OFDMA Optimisation

Activities

17th British-French-German Optimisation Conference (BFG 2015)

61st Annual Conference of the Operational Research Society

Research outputs

The Steiner travelling salesman problem with correlated costs

A cut-and-branch algorithm for the quadratic knapsack problem

Cutting planes for RLT relaxations of mixed 0-1 polynomial programs

A new separation algorithm for the Boolean quadric and cut polytopes

A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs

A dynamic programming heuristic for the quadratic knapsack problem

Unbounded convex sets for non-convex mixed-integer quadratic programming

On the gap inequalities for the max-cut problem

Complexity results for the gap inequalities for the max-cut problem

Gap inequalities for the max-cut problem: a cutting-plane algorithm

Non-convex mixed-integer nonlinear programming: a survey

Some unbounded convex sets arising in non-convex MIQP

Gap inequalities for non-convex mixed-integer quadratic programs

Integer quadratic quasi-polyhedra

An exact algorithm for a resource allocation problem in mobile wireless communications

A note on representations of linear inequalities in non-convex mixed-integer quadratic programs

Preface: The 2013 Newton Institute programme on polynomial optimisation

A guide to conic optimisation and its applications

A heuristic for maximising energy efficiency in OFDMA systems with QoS constraints

A binarisation heuristic for non-convex quadratic programming with box constraints

A heuristic for fair dynamic resource allocation in over-loaded OFDMA systems

Using ℓ_p-norms for fairness in combinatorial optimisation

Valid inequalities for quadratic optimisation with domain constraints

Quick Links

Connect With Us

Faculties & Depts

Contact Us