Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting
THEORETICAL COMPUTER SCIENCE, pp. 86-105, 2020.
EI
Abstract:
A classic result of Lenstra [Math. Oper. Res. 1983] says that an integer linear program can be solved in fixed-parameter tractable (FPT) time for the parameterization by the number of variables. We extend this result by incorporating piecewise linear convex or concave functions to our (mixed) integer programs. This general technique allow...More
Code:
Data:
Get fulltext within 24h
Other Links
Upload PDF
1.Your uploaded documents will be check within 24h, and coins will be credited to your account.
2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.
3.10 coins will be exchanged for 1 yuan.
?
￥
Upload a single paper
for 5 coins
Wechat's Red Packet
?
￥
Upload 50 articles
for 250 coins
Wechat's Red Packet
?
￥
Upload 200 articles
for 1000 coins
Wechat's Red Packet
?
￥
Upload 500 articles
for 2500 coins
Wechat's Red Packet
?
￥
Upload 1000 articles
for 5000 coins
Wechat's Red Packet
Tags
Comments