Old Web
English
Sign In
Acemap
>
Paper
>
Optimization for a mixed integer programming problem (Nonlinear Analysis and Convex Analysis)
Optimization for a mixed integer programming problem (Nonlinear Analysis and Convex Analysis)
2013
Syuuji Yamada
Tamaki Tanaka
Tetsuzo Tanino
Keywords:
Branch and price
Integer points in convex polyhedra
Mathematical optimization
Global optimization
Cutting-plane method
Integer programming
Nonlinear programming
Proper convex function
Convex optimization
Mathematics
Conic optimization
Convex analysis
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]