Cooperative Covering Problems on NetworksAVERBAKH, Igor; BERMAN, Oded; KRASS, Dmitry et al.Networks (New York, NY). 2014, Vol 63, Num 4, pp 334-349, issn 0028-3045, 16 p.Article

Parametric optimization with uncertainty on the left hand side of linear programsKHALILPOUR, Rajab; KARIMI, La.Computers & chemical engineering. 2014, Vol 60, pp 31-40, issn 0098-1354, 10 p.Article

A branch-and-cut algorithm for the discrete (r|p)-centroid problemROBOREDO, Marcos Costa; PESSOA, Artur Alves.European journal of operational research. 2013, Vol 224, Num 1, pp 101-109, issn 0377-2217, 9 p.Article

Achieving MILP feasibility quickly using general disjunctionsMAHMOUD, Hanan; CHINNECK, John W.Computers & operations research. 2013, Vol 40, Num 8, pp 2094-2102, issn 0305-0548, 9 p.Article

Solving a separation-network synthesis problem by interval global optimization techniqueSZLAMA, A; KALAUZ, K; HECKL, I et al.Computers & chemical engineering. 2013, Vol 56, pp 142-154, issn 0098-1354, 13 p.Article

Emergent Nature Inspired Algorithms for Multi-Objective OptimizationFIGUEIRA, José Rui; TALBI, El-Ghazali.Computers & operations research. 2013, Vol 40, Num 6, issn 0305-0548, 142 p.Serial Issue

A heuristic algorithm based on Lagrangian relaxation for the closest string problemTANAKA, Shunji.Computers & operations research. 2012, Vol 39, Num 3, pp 709-717, issn 0305-0548, 9 p.Article

Algorithmic aspects for multiple-choice hardware/software partitioningJIGANG WU; QIQIANG SUN; SRIKANTHAN, Thambipillai et al.Computers & operations research. 2012, Vol 39, Num 12, pp 3281-3292, issn 0305-0548, 12 p.Article

An LPCC approach to nonconvex quadratic programsJING HU; MITCHELL, John E; PANG, Jong-Shi et al.Mathematical programming (Print). 2012, Vol 133, Num 1-2, pp 243-277, issn 0025-5610, 35 p.Article

Feasibility in reverse convex mixed-integer programmingOBUCHOWSKA, Wiesława T.European journal of operational research. 2012, Vol 218, Num 1, pp 58-67, issn 0377-2217, 10 p.Article

Fitting piecewise linear continuous functionsTORIELLO, Alejandro; VIELMA, Juan Pablo.European journal of operational research. 2012, Vol 219, Num 1, pp 86-95, issn 0377-2217, 10 p.Article

Partitioning a Weighted Tree into Subtrees with Weights in a Given RangeITO, Takehiro; NISHIZEKI, Takao; SCHRÖDER, Michael et al.Algorithmica. 2012, Vol 62, Num 3-4, pp 823-841, issn 0178-4617, 19 p.Article

Representing quadratically constrained quadratic programs as generalized copositive programsBURER, Samuel; DONG, Hongbo.Operations research letters. 2012, Vol 40, Num 3, pp 203-206, issn 0167-6377, 4 p.Article

The eye and the fist: Optimizing search and interdictionKRESS, M; ROYSET, J. O; ROZEN, N et al.European journal of operational research. 2012, Vol 220, Num 2, pp 550-558, issn 0377-2217, 9 p.Article

The master equality polyhedron with multiple rowsDASH, Sanjeeb; FUKASAWA, Ricardo; GÜNLÜK, Oktay et al.Mathematical programming (Print). 2012, Vol 132, Num 1-2, pp 125-151, issn 0025-5610, 27 p.Article

A strongly polynomial algorithm for linear systems having a binary solutionCHUBANOV, Sergei.Mathematical programming (Print). 2012, Vol 134, Num 2, pp 533-570, issn 0025-5610, 38 p.Article

Mixed Integer Nonlinear Programming (MINLP)Mathematical programming (Print). 2012, Vol 136, Num 2, issn 0025-5610, 175 p.Conference Proceedings

Parametric Optimization-Recent AdvancesMathematical programming (Print). 2012, Vol 136, Num 1, issn 0025-5610, 229 p.Conference Proceedings

On convex relaxations for quadratically constrained quadratic programmingANSTREICHER, Kurt M.Mathematical programming (Print). 2012, Vol 136, Num 2, pp 233-251, issn 0025-5610, 19 p.Conference Paper

Some results on the strength of relaxations of multilinear functionsLUEDTKE, James; NAMAZIFAR, Mahdi; LINDEROTH, Jeff et al.Mathematical programming (Print). 2012, Vol 136, Num 2, pp 325-351, issn 0025-5610, 27 p.Conference Paper

Heuristic methods for the optimal statistic median problemBENATI, Stefano.Computers & operations research. 2011, Vol 38, Num 1, pp 379-386, issn 0305-0548, 8 p.Article

A dynamic convexized method for nonconvex mixed integer nonlinear programmingWENXING ZHU; GENG LIN.Computers & operations research. 2011, Vol 38, Num 12, pp 1792-1804, issn 0305-0548, 13 p.Article

A new linearization method for generalized linear multiplicative programmingWANG, Chun-Feng; LIU, San-Yang.Computers & operations research. 2011, Vol 38, Num 7, pp 1008-1013, issn 0305-0548, 6 p.Article

A new method for solving fully fuzzy linear programming problemsKUMAR, Amit; KAUR, Jagdeep; SINGH, Pushpinder et al.Applied mathematical modelling. 2011, Vol 35, Num 2, pp 817-823, issn 0307-904X, 7 p.Article

Approximation of linear fractional-multiplicative problemsDEPETRINI, Daniele; LOCATELLI, Marco.Mathematical programming (Print). 2011, Vol 128, Num 1-2, pp 437-443, issn 0025-5610, 7 p.Article