Changeset 126


Ignore:
Timestamp:
Apr 19, 2007 2:46:44 PM (13 years ago)
Author:
barahon
Message:

x

File:
1 edited

Legend:

Unmodified
Added
Removed
  • trunk/Vol/doc/volDoc.tex

    r79 r126  
    1818\title{\bf An implementation of the Volume Algorithm}
    1919\author{Francisco Barahona and Laszlo Ladanyi}
    20 \date{June 7, 2006}
     20\date{April 19, 2007}
    2121\maketitle
    2222
     
    2626Here we describe an implementation of the Volume algorithm (VA) originally
    2727presented in \cite{BA1}. The following sub-directories of
    28 {\tt COIN} contain the relevant pieces. The directory {\tt COIN/Vol}
    29 contains the core of the algorithm. The directory {\tt COIN/Examples/VolUfl}
     28{\tt coin-Vol} contain the relevant pieces. The directory {\tt coin-Vol/Vol/src}
     29contains the core of the algorithm. The directory {\tt coin-Vol/Vol/examples/VolUfl}
    3030contains the necessary files for solving uncapacitated facility location
    31 problems. The directory {\tt COIN/Examples/Volume-LP} contains code for
     31problems. The directory \break {\tt coin-Vol/Vol/examples/Volume-LP} contains code for
    3232dealing with combinatorial linear programs. The directory
    33 {\tt COIN/Examples/VolLp} also contains code for combinatorial linear
     33{\tt coin-Vol/Vol/examples/VolLp} also contains code for combinatorial linear
    3434programs, this implementation relies on other parts of {\tt COIN}, while
    35 the implementation in {\tt COIN/Examples/Volume-LP} is self-contained.
     35the implementation in \break {\tt coin-Vol/Vol/examples/Volume-LP} is self-contained.
    3636In {\tt COIN/Osi/OsiVol} there is code to call the VA through {\tt OSI}.
    3737%The directory {\tt COIN/Clp/Samples} contains sample code for using
    3838%the VA followed by {\tt Clp}.
    39 The directory {\tt COIN/Examples/MaxCut}
    40 contains code for doing Branch-and-Cut based on the VA, this is
    41 applied to the Max-Cut problem.
     39%The directory {\tt COIN/Examples/MaxCut}
     40%contains code for doing Branch-and-Cut based on the VA, this is
     41%applied to the Max-Cut problem.
    4242
    4343Now we give the details of each directory. We hope to receive reports about bugs and/or
     
    4545
    4646
    47 \section{{\tt COIN/Vol}}
    48 This directory contains the core of the algorithm, most users should not need
    49 to modify any of the files here. The files are {\tt INSTALL}, {\tt Makefile}
    50 and {\tt VolVolume.cpp}. The file {\tt INSTALL} contains information on how
    51 to compile and build the code, on Linux it is enough to type ``{\tt make}''.
     47\section{{\tt coin-Vol}}
     48Most users should not need
     49to modify any of the files here. The file {\tt INSTALL} contains information on how
     50to compile and build the code.
     51
     52\section{{\tt coin-Vol/Vol/src}}
    5253The algorithm is in {\tt VolVolume.cpp} and the header file is
    53 {\tt VolVolume.hpp} in the directory {\tt COIN/Vol/include}.
    54 
    55 
    56 
    57 \section{{\tt COIN/Examples/VolUfl}}
     54{\tt VolVolume.hpp}.
     55
     56
     57
     58\section{{\tt coin-Vol/Vol/Examples/VolUfl}}
    5859We focus here on the {\it uncapacitated facility location
    5960problem} (UFLP) as an example of implementation, see \cite{BC} for some of the theoretical
    60 issues. The files here are {\tt INSTALL}, {\tt Makefile}, {\tt Makefile.ufl},
     61issues. The files here are {\tt INSTALL}, {\tt Makefile}, {\tt Makefile.in},
    6162{\tt ufl.cpp}, {\tt ufl.hpp}, {\tt ufl.par} and {\tt data.gz}.
    6263The file {\tt INSTALL} contains information on how to compile and build.
     
    399400%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
    400401
    401 \section{{\tt COIN/Examples/Volume-LP}}
     402\section{{\tt coin-Vol/Vol/examples/Volume-LP}}
    402403
    403404Here we focus on {\it Combinatorial Linear Programs},
     
    410411
    411412
    412 Initially this directory contains the files: {\tt README, Makefile,
    413 lp.hpp, lp.cpp, lp.par,} \goodbreak
     413Initially this directory contains the files: {\tt README, Makefile, Makefile.in
     414lp.hpp, lp.cpp, lp.par,} %\goodbreak
    414415{\tt data.mps.gz, lpc.h, lpc.cpp,
    415416reader.h, reader.cpp}. On a Unix system one
    416 should type ``{\tt make}'', ``{\tt gunzip data.mps.gz}'' and ``{\tt volume-lp}''
     417should type ``{\tt make}'' and ``{\tt volume-lp}''
    417418to run the code. Then the code will run and produce the files {\tt primal.txt}
    418419and {\tt dual.txt} that contain approximate solutions to both the primal
     
    538539the code in {\tt reader.cpp}.
    539540
    540 \section{{\tt COIN/Examples/VolLp}}
     541\section{{\tt coin-Vol/Vol/examples/VolLp}}
    541542
    542543This code treats linear programs in a similar way as it is done in
    543 {\tt COIN/Examples/Volume-LP}, the main difference is that this
     544{\tt coin-Vol/Vol/examples/Volume-LP}, the main difference is that this
    544545code uses other components of {\tt COIN-OR} while the code in \goodbreak
    545 {\tt COIN/Examples/Volume-LP} is self contained.
    546 The files here are {\tt INSTALL, Makefile, \goodbreak
     546{\tt coin-Vol/Vol/examples/Volume-LP} is self contained.
     547The files here are {\tt INSTALL, Makefile, Makefile.in %\goodbreak
    547548Makefile.vollp, vollp.cpp}.
    548549The {\tt INSTALL} contains instructions on how to compile and build
     
    586587%by the VA calls dual simplex.
    587588
    588 \section{{\tt COIN/Examples/MaxCut}}
    589 
    590 This directory contains code for doing Branch-and-Cut based on the
    591 VA as in \cite{BL}. The code is specialized to the Max-Cut problem.
     589%\section{{\tt COIN/Examples/MaxCut}}
     590
     591%This directory contains code for doing Branch-and-Cut based on the
     592%VA as in \cite{BL}. The code is specialized to the Max-Cut problem.
    592593
    593594
Note: See TracChangeset for help on using the changeset viewer.