| 1 |
BalakrishnanA,GravesS C.A composite algorithm for a concave-cost network flow problem[J].Networks,1989,19(2):175-202.
doi: 10.1002/net.3230190202
|
| 2 |
MagnantiT L,MirchandaniP,VachaniR.Modeling and solving the two-facility capacitated network loading problem[J].Operations Research,1995,43(1):142-157.
doi: 10.1287/opre.43.1.142
|
| 3 |
HolmbergK.Solving the staircase cost facility location problem with decomposition and piecewise linearization[J].European Journal of Operational Research,1994,75(1):41-61.
doi: 10.1016/0377-2217(94)90184-8
|
| 4 |
CroxtonK L,GendronB,MagnantiT L.A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems[J].Management Science,2003,49(9):1268-1273.
doi: 10.1287/mnsc.49.9.1268.16570
|
| 5 |
SridharS,LinderothJ,LuedtkeJ.Locally ideal formulations for piecewise linear functions with indicator variables[J].Operations Research Letters,2013,41(6):627-632.
doi: 10.1016/j.orl.2013.08.010
|
| 6 |
VielmaJ P,AhmedS,NemhauserG.Mixed-integer models for nonseparable piecewise-linear optimization: Unifying framework and extensions[J].Operations Research,2009,58(2):303-315.
|
| 7 |
CeriaS,CordierC,MarchandH,et al.Cutting planes for integer programs with general integer variables[J].Mathematical Programming,1998,81,201-214.
|
| 8 |
MarchandH,WolseyL A.The 0-1 knapsack problem with a single continuous variable[J].Mathematical Programming,1999,85,15-33.
doi: 10.1007/s101070050044
|
| 9 |
BalasE.Facets of the knapsack polytope[J].Mathematical Programming,1975,8,146-164.
doi: 10.1007/BF01580440
|
| 10 |
WeismantelR.On the 0/1 knapsack polytope[J].Mathematical Programming,1997,77,49-68.
|
| 11 |
GuZ,NemhauserG L,SavelsberghM W.Lifted cover inequalities for 0-1 integer programs: Computation[J].INFORMS Journal on Computing,1998,10(4):427-437.
doi: 10.1287/ijoc.10.4.427
|
| 12 |
Brockmüller B, Günlück O, Wolsey L A, et al. Designing private line networks-polyhedral analysis and computation[R]. Université catholique de Louvain, Center for Operations Research and Econometrics, 1996.
|
| 13 |
AtamtürkA,RajanD.On splittable and unsplittable flow capacitated network design arc-set polyhedra[J].Mathematical Programming,2002,92(2):315-333.
doi: 10.1007/s101070100269
|
| 14 |
van HoeselS P,KosterA M,van de LeenselR L,et al.Polyhedral results for the edge capacity polytope[J].Mathematical Programming,2002,92,335-358.
doi: 10.1007/s101070200292
|
| 15 |
BenhamicheA,MahjoubA R,PerrotN,et al.Unsplittable non-additive capacitated network design using set functions polyhedra[J].Computers & Operations Research,2016,66,105-115.
|
| 16 |
ChenL,ChenW,YangM,et al.An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron[J].Journal of Global Optimization,2021,81,659-689.
doi: 10.1007/s10898-020-00967-z
|
| 17 |
CroxtonK L,GendronB,MagnantiT L.Variable disaggregation in network flow problems with piecewise linear costs[J].Operations Research,2007,55(1):146-157.
doi: 10.1287/opre.1060.0314
|
| 18 |
CrainicT G,FrangioniA,GendronB.Bundle-based relaxation methods for multicommodity capacitated fixed charge network design[J].Discrete Applied Mathematics,2001,112(1-3):73-99.
doi: 10.1016/S0166-218X(00)00310-3
|
| 19 |
Achterberg T. Constraint integer programming[D]. Berlin: Technical University of Berlin, 2007.
|
)
