Various improvements in NetworkSimplex.
- Faster variant of "Altering Candidate List" pivot rule using make_heap
instead of partial_sort.
- Doc improvements.
- Removing unecessary inline keywords.
3 * This file is a part of LEMON, a generic C++ optimization library
5 * Copyright (C) 2003-2008
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
9 * Permission to use, modify and distribute this software is granted
10 * provided that this copyright notice appears in all copies. For
11 * precise terms see the accompanying LICENSE file.
13 * This software is provided "AS IS" with no warranty of any kind,
14 * express or implied, and with no claim as to its suitability for any
19 #ifndef LEMON_MIP_GLPK_H
20 #define LEMON_MIP_GLPK_H
23 ///\brief Header of the LEMON-GLPK mip solver interface.
27 #include <lemon/lp_glpk.h>
30 /// \brief Interface for the GLPK MIP solver
32 /// This class implements an interface for the GLPK MIP solver.
34 class MipGlpk : public MipSolverBase, public LpGlpk{
38 typedef MipSolverBase ParentMip;
39 typedef LpGlpk ParentLp;
48 virtual ColTypes _colType(int col) const;
49 virtual void _colType(int col, ColTypes col_type);
51 virtual LpGlpk::SolveExitStatus _solve();
52 virtual LpGlpk::SolutionStatus _getMipStatus() const;
53 virtual ParentLp::Value _getPrimal(int i) const;
54 virtual ParentLp::Value _getPrimalValue() const;
57 } //END OF NAMESPACE LEMON
59 #endif // END OF LEMON_MIP_GLPK_H