Skip to main navigation
Skip to search
Skip to main content
University of Edinburgh Research Explorer Home
Help & FAQ
Home
Research output
Profiles
Research Units
Projects
Datasets
Prizes
Activities
Press / Media
Equipment
Search by expertise, name or affiliation
IP-MATCH: Integer Programming for Large and Complex Matching Problems
Garcia Quiles, Sergio
(Principal Investigator)
Gondzio, Jacek
(Co-investigator)
Kalcsics, Joerg
(Co-investigator)
School of Mathematics
Overview
Fingerprint
Research output
(3)
Research output
Research output per year
2019
2019
2020
2020
3
Article
Research output per year
Research output per year
3 results
Title
(descending)
Publication Year, Title
Title
(ascending)
Type
Search results
Stability in the Hospitals / Residents problem with Couples and Ties: Mathematical models and computational studies
Delorme, M.
,
Garcia, S.
,
Gondzio, J.
,
Kalcsics, J.
,
Manlove, D.
&
Pettersson, W.
,
10 Dec 2020
, (E-pub ahead of print)
In:
Omega.
38 p.
, 102386.
Research output
:
Contribution to journal
›
Article
›
peer-review
Mathematical Model
100%
Residents
76%
Doctors
70%
Stable Matching
47%
Integer Linear Programming
44%
Mathematical models and decomposition methods for the multiple knapsack problem
Dell'Amico, M.
,
Delorme, M.
,
Iori, M.
&
Martello, S.
,
1 May 2019
,
In:
European Journal of Operational Research.
274
,
3
,
p. 886-899
24 p.
Research output
:
Contribution to journal
›
Article
›
peer-review
Open Access
File
Decomposition Algorithm
100%
Knapsack Problem
93%
Decomposition Method
84%
Mathematical Model
81%
Polynomials
69%
Improving solution times for stable matching problems through preprocessing
Petterssona, W.
,
Delorme, M.
,
Garcia, S.
,
Gondzio, J.
,
Kalcsics, J.
&
Manlove, D.
,
26 Oct 2020
, (E-pub ahead of print)
In:
Computers and Operations Research.
39 p.
Research output
:
Contribution to journal
›
Article
›
peer-review
Open Access
File
Stable Matching
100%
Matching Problem
97%
Tie
84%
Preprocessing
83%
Integer Programming
52%