fixcand.h File Reference

candidates for fixing. More...

#include "abacus/array.h"

Go to the source code of this file.

Classes
class	ABA_FIXCAND
	candidates for fixing More...

---

Detailed Description

candidates for fixing.

Author:

Matthias Elf

Variables can be only fixed according to the reduced costs and statuses of variables of the root of the remaining \ tree. However, if we store these values, we can repeat the fixing process also in any other node of the enumeration tree when we find a better global lower bound.

Possible candidates for fixing are all variables which have the status AtLowerBound or AtUpperBound. We store all these candidates together with their values in this class.

If we try to fix variables according to reduced cost criteria in nodes which are not the root of the remaining \ tree, we always have to take the candidates and values from this class.

License:

This file is part of ABACUS - A Branch And CUt System Copyright (C) 1995 - 2003 University of Cologne, Germany

This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version.

This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.

You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA

See also:

http://www.gnu.org/copyleft/gpl.html

Definition in file fixcand.h.

---