Combinatorial n-fold integer programming and applications
Open Access
- 20 November 2019
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 184 (1-2) , 1-34
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- European Research Council (306465)
- Grantová Agentura České Republiky (CE-ITI P202/12/G061)
- Grantová Agentura, Univerzita Karlova (1784214)
- Deutsche Forschungsgemeinschaft (MN 59/4-1)
- Israel Science Foundation (308/18)
- Univerzita Karlova v Praze (UNCE/SCI/004)
This publication has 51 references indexed in Scilit:
- Efficient algorithms for consensus string problems minimizing both distance sum and radiusTheoretical Computer Science, 2011
- Parameterized complexity of coloring problems: Treewidth versus vertex coverTheoretical Computer Science, 2011
- Closest string with outliersBMC Bioinformatics, 2011
- More Efficient Algorithms for Closest String and Substring ProblemsSIAM Journal on Computing, 2010
- Carathéodory bounds for integer conesOperations Research Letters, 2006
- Distinguishing string selection problemsInformation and Computation, 2003
- On the closest string and substring problemsJournal of the ACM, 2002
- Convex separable optimization is not much harder than linear optimizationJournal of the ACM, 1990
- On the complexity of integer programmingJournal of the ACM, 1981
- Condorcet Social Choice FunctionsSIAM Journal on Applied Mathematics, 1977