| P.M. Camerini, M. Conforti, D. Naddef, "Some easily solvable nonlinear integer programs," Ricerca Operativa, vol. 50, pp. 11-25, 1989. |
....Japan, shiouradais. is. t ohoku. ac. jp. I Introduction In recent years, combinatorial optimization problems with nonlinear objective functions have been dealt with, and extensive studies have been done for revealing the well solved structure in nonlinear combinatorial opti mization problems [2, 4, 9, 10, 11, 23, 15, 16]. The concepts of M convexity and L convexity, introduced by Murota [12, 13, 15, 16] for functions on the integer lattice, extract combinatorial structures in well solved nonlinear combinatorial optimization problems; subsequently, their variants called M convexity and Lb convexity were ....
P.M. Camerini, M. Conforti, D. Naddef, "Some easily solvable nonlinear integer programs," Ricerca Operativa, vol. 50, pp. 11-25, 1989.
No context found.
Camerini, P. M., Conforti, M., Naddef, D.(1989): Some easily solvable nonlinear integer programs. Ricerca Operativa 50, 11-25
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC