Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem

Author： Hansen P. Jaumard B. de Aragao M.P.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.108, Iss.3, 1998-08, pp. : 671-683

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A simple Tabu Search method to solve the mixed-integer linear bilevel programming problem

By U. P.W. A. D.H.

European Journal of Operational Research, Vol. 88, Iss. 3, 1996-02 ,pp. : 563-571

Elsevier

Access to resources Recommend Favorite

An efficient linearization approach for mixed-integer problems

By Chang C.-T.

European Journal of Operational Research, Vol. 123, Iss. 3, 2000-06 ,pp. : 652-659

Elsevier

Access to resources Recommend Favorite

A note on a decision support system for multiobjective integer and mixed-integer programming problems

By Alves M.J. Climaco J.

European Journal of Operational Research, Vol. 155, Iss. 1, 2004-05 ,pp. : 258-265

Elsevier

Access to resources Recommend Favorite

The maximum capture problem with random utilities: Problem formulation and algorithms

By Benati S. Hansen P.

European Journal of Operational Research, Vol. 143, Iss. 3, 2002-12 ,pp. : 518-530

Elsevier

Access to resources Recommend Favorite

Average shadow price in a Mixed Integer Linear programming problem

By Crema A.

European Journal of Operational Research, Vol. 85, Iss. 3, 1995-09 ,pp. : 625-635

Elsevier

Access to resources Recommend Favorite