.png){kind=icon}
.png){kind=icon}
Return
Corporate structure optimisation for multinational companies
.png){kind=icon}
PRE
AI
DOI：10.1016/j.omega.2011.06.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we consider a multinational corporate structuring problem. This problem involves designing a corporate/organisational structure (across different countries) so as to remit profits from a number of subsidiaries to a single parent company, whilst minimising the tax paid (maximise the amount received at the parent company). This corporate structure is constrained to be a (directed) tree structure. We present a mixed-integer zero-one formulation of the problem that (for the test problems examined) provides very good linear programming relaxation bounds. We also present a tabu search heuristic for the problem which, when combined with the bounds provided by the linear programming relaxation, is able to find provably optimal solutions. Extensions to the basic corporate structuring problem and how they can be dealt with using our heuristic are also discussed. Computational results for the solution (to proven optimality) of publicly available test problems involving up to 150 countries are reported. The largest problem solved previously in the literature to proven optimality involved only 22 countries. (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Heuristics
Mathematical programming
Optimisation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
O
IF:
7.2
Papers:
3.7K
Citations:
1.4W